Search Results

Documents authored by Gorrieri, Roberto

Document
DOI: 10.4230/LIPIcs.MFCS.2021.28
A Decidable Equivalence for a Turing-Complete, Distributed Model of Computation

Authors: Arnaldo Cesco and Roberto Gorrieri

Published in: LIPIcs, Volume 202, 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 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.
Cite as

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)

Copy BibTex To Clipboard

@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}
}
Document
DOI: 10.4230/DagSemRep.294
Security through Analysis and Verification (Dagstuhl Seminar 00501)

Authors: Pierpaolo Degano, Roberto Gorrieri, Chris Hankin, Flemming Nielson, and Hanne Riis Nielson

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

Pierpaolo Degano, Roberto Gorrieri, Chris Hankin, Flemming Nielson, and Hanne Riis Nielson. Security through Analysis and Verification (Dagstuhl Seminar 00501). Dagstuhl Seminar Report 294, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2001)

Copy BibTex To Clipboard

@TechReport{degano_et_al:DagSemRep.294,
  author =	{Degano, Pierpaolo and Gorrieri, Roberto and Hankin, Chris and Nielson, Flemming and Riis Nielson, Hanne},
  title =	{{Security through Analysis and Verification (Dagstuhl Seminar 00501)}},
  pages =	{1--15},
  ISSN =	{1619-0203},
  year =	{2001},
  type = 	{Dagstuhl Seminar Report},
  number =	{294},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.294},
  URN =		{urn:nbn:de:0030-drops-151781},
  doi =		{10.4230/DagSemRep.294},
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact