A Decidable Equivalence for a Turing-complete, Distributed Model of Computation
arXiv:2104.14859 · doi:10.4230/LIPIcs.MFCS.2021.28
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.
arXiv admin note: substantial text overlap with arXiv:2104.01392