activity
20102025
most citedOn the Decidability of Non Interference over Unbounded Petri Nets

17 citations · 26 across the 12 of their papers we have counts for

collaborators

12 papers

cs.LO2025

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},…

cs.LO2023

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…

cs.LO2023

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…

cs.LO2023

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…

cs.CR2023

Distributed Non-Interference

Roberto Gorrieri

Information flow security properties were defined some years ago (see, e.g., the surveys \cite{FG01,Ry01}) in terms of suitable equivalence checking problems. These definitions wer…

cs.FL2023

The Algebra of Nondeterministic Finite Automata

Roberto Gorrieri

A process algebra is proposed, whose semantics maps a term to a nondeterministic finite automaton (NFA, for short). We prove a representability theorem: for each NFA , there exi…