Petri Nets (PN) are a central model for concurrent or distributed systems, but not expressive enough to deal with dynamic reconfiguration. Rewriting Logic in turn has proved to be a natural framework for several models of distributed systems. We propose an efficient Maude formalization of dynamically reconfigurable PT nets (with inhibitor arcs), using as a running example a fault-tolerant manufacturing system. We discuss the advantages of such a hybrid approach and some raised concerns.
An Efficient Maude Formalization of (Rewritable) PT Nets / L. Capra - In: 2021 23rd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) / [a cura di] C. Schneider, M. Marin, V. Negru, D. Zaharie. - Prima edizione. - [s.l] : IEEE, 2021. - ISBN 978-1-6654-0650-5. - pp. 186-193 (( Intervento presentato al 23. convegno International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) tenutosi a Timisoara nel 2021 [10.1109/SYNASC54541.2021.00040].
An Efficient Maude Formalization of (Rewritable) PT Nets
L. Capra
Primo
Formal Analysis
2021
Abstract
Petri Nets (PN) are a central model for concurrent or distributed systems, but not expressive enough to deal with dynamic reconfiguration. Rewriting Logic in turn has proved to be a natural framework for several models of distributed systems. We propose an efficient Maude formalization of dynamically reconfigurable PT nets (with inhibitor arcs), using as a running example a fault-tolerant manufacturing system. We discuss the advantages of such a hybrid approach and some raised concerns.
| File | Dimensione | Formato | |
|---|---|---|---|
|
An_Efficient_Maude_Formalization_of_Rewritable_PT_Nets.pdf
accesso riservato
Tipologia:
Publisher's version/PDF
Dimensione
293.48 kB
Formato
Adobe PDF
|
293.48 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
