License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2021.28
URN: urn:nbn:de:0030-drops-144686
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/14468/
Cesco, Arnaldo ;
Gorrieri, Roberto
A Decidable Equivalence for a Turing-Complete, Distributed Model of Computation
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.
BibTeX - Entry
@InProceedings{cesco_et_al:LIPIcs.MFCS.2021.28,
author = {Cesco, Arnaldo and Gorrieri, Roberto},
title = {{A Decidable Equivalence for a Turing-Complete, Distributed Model of Computation}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {28:1--28:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14468},
URN = {urn:nbn:de:0030-drops-144686},
doi = {10.4230/LIPIcs.MFCS.2021.28},
annote = {Keywords: Petri nets, Inhibitor arc, Behavioral equivalence, Bisimulation, Decidability}
}
|
Keywords: |
|
Petri nets, Inhibitor arc, Behavioral equivalence, Bisimulation, Decidability |
|
Collection: |
|
46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021) |
|
Issue Date: |
|
2021 |
|
Date of publication: |
|
18.08.2021 |
