A Decidable Equivalence for a Turing-complete, Distributed Model of Computation
Logic in Computer Science
2022-11-03 v2
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.
Keywords
Cite
@article{arxiv.2104.14859,
title = {A Decidable Equivalence for a Turing-complete, Distributed Model of Computation},
author = {Arnaldo Cesco and Roberto Gorrieri},
journal= {arXiv preprint arXiv:2104.14859},
year = {2022}
}
Comments
arXiv admin note: substantial text overlap with arXiv:2104.01392