17 citations · 26 across the 12 of their papers we have counts for
9 papers · 1 filter
Decidable Reversible Equivalences for Finite Petri Nets
Roberto Gorrieri, Ivan Lanese
In the setting of Petri nets, we prove that {\em causal-net bisimilarity} \cite{G15,Gor22,Gor25a}, which is a refinement of history-preserving bisimilarity \cite{RT88,vGG89,DDM89},…
Compositional Semantics of Finite Petri Nets
Roberto Gorrieri
Structure-preserving bisimilarity is a truly concurrent behavioral equivalence for finite Petri nets, which relates markings (of the same size only) generating the same causal nets…
Branching Place Bisimilarity
Roberto Gorrieri
Place bisimilarity is a behavioral equivalence for finite Petri nets, proposed in \cite{ABS91} and proved decidable in \cite{Gor21}. In this paper we propose an extension to finite…
Compositional Net Semantics up to Step Net Bisimilarity
Roberto Gorrieri
Step net bisimilarity \cite{Gor23} is a truly concurrent behavioral equivalence for finite Petri nets, which is defined as a smooth generalization of standard step bisimilarity \ci…
True Concurrency Can Be Easy
Roberto Gorrieri
Step net bisimulation is a coinductive behavioral relation for finite Petri nets, which is a smooth generalization of the definition of standard step bisimulation \cite{NT84} on fi…
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…