A Decidable Equivalence for a Turing-complete, Distributed Model of Computation
Arnaldo Cesco, Roberto Gorrieri
TL;DR
This paper introduces a new decidable behavioral equivalence for Turing-complete Petri nets with inhibitor arcs, enabling more effective analysis of their behavior while respecting their causal semantics.
Contribution
It defines pti-place bisimilarity, a decidable equivalence that extends place bisimilarity to PTI nets, and proves its sensibility and causal correctness.
Findings
pti-place bisimilarity is decidable
It extends existing place bisimilarity
It respects the causal semantics of PTI nets
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.