Place/Transition Petri nets with inhibitor arcs (PTI nets for short), which are a well-known Turing-complete, distributed model of computation, are equipped with a decidable, behavioral equivalence, called pti-place bisimilarity, that conservatively extends place bisimilarity defined over Place/Transition nets (without inhibitor arcs). We prove that pti-place bisimilarity is sensible, as it respects the causal semantics of PTI nets.
A Decidable Equivalence for a Turing-Complete, Distributed Model of Computation / Arnaldo Cesco; Roberto Gorrieri. - ELETTRONICO. - 202:28(2021), pp. 1-18. (Intervento presentato al convegno 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021) tenutosi a Tallinn, Estonia nel 23-27 agosto 2021) [10.4230/LIPIcs.MFCS.2021.28].
A Decidable Equivalence for a Turing-Complete, Distributed Model of Computation
Arnaldo Cesco;Roberto Gorrieri
2021
Abstract
Place/Transition Petri nets with inhibitor arcs (PTI nets for short), which are a well-known Turing-complete, distributed model of computation, are equipped with a decidable, behavioral equivalence, called pti-place bisimilarity, that conservatively extends place bisimilarity defined over Place/Transition nets (without inhibitor arcs). We prove that pti-place bisimilarity is sensible, as it respects the causal semantics of PTI nets.| File | Dimensione | Formato | |
|---|---|---|---|
|
LIPIcs-MFCS-2021-28.pdf
accesso aperto
Tipo:
Versione (PDF) editoriale
Licenza:
Licenza per Accesso Aperto. Creative Commons Attribuzione - Condividi allo stesso modo (CCBYSA)
Dimensione
722.84 kB
Formato
Adobe PDF
|
722.84 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
