Petri Nets are a central model for concurrent or distributed systems but are not expressive enough to specify a system’s dynamic reconfiguration. Rewriting Logic, in turn, has proved to be a suitable framework for several formal models of distributed systems. We have recently proposed an efficient Maude formalization of dynamically reconfigurable PT nets. In this paper, we address the scalability of this model using a canonization technique for PT systems integrated into Maude.
Canonization of Reconfigurable PT Nets in Maude / L. Capra (LECTURE NOTES IN COMPUTER SCIENCE). - In: Reachability Problems / [a cura di] A.W. Lin, G. Zetzsche, I. Potapov. - [s.l] : Springer Cham, 2022 Oct. - ISBN 978-3-031-19134-3. - pp. 160-177 (( Intervento presentato al 16. convegno RP tenutosi a Kaiserslautern nel 2022 [10.1007/978-3-031-19135-0_11].
Canonization of Reconfigurable PT Nets in Maude
L. Capra
Primo
Writing – Original Draft Preparation
2022
Abstract
Petri Nets are a central model for concurrent or distributed systems but are not expressive enough to specify a system’s dynamic reconfiguration. Rewriting Logic, in turn, has proved to be a suitable framework for several formal models of distributed systems. We have recently proposed an efficient Maude formalization of dynamically reconfigurable PT nets. In this paper, we address the scalability of this model using a canonization technique for PT systems integrated into Maude.
| File | Dimensione | Formato | |
|---|---|---|---|
|
978-3-031-19135-0_11.pdf
accesso riservato
Tipologia:
Publisher's version/PDF
Dimensione
481.42 kB
Formato
Adobe PDF
|
481.42 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.
