Published in: LIPIcs, Volume 202, 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)
Arnaldo Cesco and Roberto Gorrieri. A Decidable Equivalence for a Turing-Complete, Distributed Model of Computation. In 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 202, pp. 28:1-28:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@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/entities/document/10.4230/LIPIcs.MFCS.2021.28},
URN = {urn:nbn:de:0030-drops-144686},
doi = {10.4230/LIPIcs.MFCS.2021.28},
annote = {Keywords: Petri nets, Inhibitor arc, Behavioral equivalence, Bisimulation, Decidability}
}
Feedback for Dagstuhl Publishing