Compositional Net Semantics up to Step Net Bisimilarity

01/11/2023
by   Roberto Gorrieri, et al.
0

Step net bisimilarity <cit.> is a truly concurrent behavioral equivalence for finite Petri nets, which is defined as a smooth generalization of standard step bisimilarity <cit.> on Petri nets, but with the property of relating markings (of the same size only) generating the same partial orders of events. The process algebra FNM <cit.> truly represents all (and only) the finite Petri nets, up to isomorphism. We prove that step net bisimilarity is a congruence w.r.t. the FMN operators, In this way, we have defined a compositional semantics, fully respecting causality and the branching structure of systems, for the class of all the finite Petri nets.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/17/2023

Compositional Semantics of Finite Petri Nets

Structure-preserving bisimilarity is a truly concurrent behavioral equiv...
research
11/01/2022

True Concurrency Can Be Easy

Step net bisimulation is a coinductive behavioral relation for finite Pe...
research
01/20/2023

Distributed Non-Interference

Information flow security properties were defined some years ago (see, e...
research
04/30/2021

Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets

We prove that (strong) fully-concurrent bisimilarity and causal-net bisi...
research
10/12/2017

Concurrency and Probability: Removing Confusion, Compositionally

Assigning a satisfactory truly concurrent semantics to Petri nets with c...
research
06/04/2021

How to Bake Quantum into Your Pet Petri Nets and Have Your Net Theory Too

Petri nets have found widespread use among many application domains, not...
research
05/07/2023

Branching Place Bisimilarity

Place bisimilarity is a behavioral equivalence for finite Petri nets, pr...

Please sign up or login with your details

Forgot password? Click here to reset