1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.LO2021
A Decidable Equivalence for a Turing-complete, Distributed Model of Computation
Arnaldo Cesco, Roberto Gorrieri
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, behav…
cs.LO2021★ 1 cited
Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets
Arnaldo Cesco, Roberto Gorrieri
We prove that the well-known (strong) fully-concurrent bisimilarity and the novel i-causal-net bisimilarity, which is a sligtlhy coarser variant of causal-net bisimilarity, are dec…