Branching Place Bisimilarity: A Decidable Behavioral Equivalence for Finite Petri Nets with Silent Moves - Formal Techniques for Distributed Objects, Components, and Systems Access content directly
Conference Papers Year : 2021

Branching Place Bisimilarity: A Decidable Behavioral Equivalence for Finite Petri Nets with Silent Moves

Abstract

Place bisimilarity $$\sim _p$$∼p is a behavioral equivalence for finite Petri nets, proposed in [1] and proved decidable in [13]. In this paper we propose an extension to finite Petri nets with silent moves of the place bisimulation idea, yielding branching place bisimilarity $$\approx _p$$≈p, following the intuition of branching bisimilarity [6] on labeled transition systems. We prove that $$\approx _p$$≈p is a decidbale equivalence relation. Moreover, we argue that it is strictly finer than branching fully-concurrent bisimilarity [12, 22], essentially because $$\approx _p$$≈p does not consider as unobservable those $$\tau $$τ-labeled net transitions with pre-set size larger than one, i.e., those resulting from multi-party interaction.
Fichier principal
Vignette du fichier
509782_1_En_5_Chapter.pdf (313.17 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03740270 , version 1 (29-07-2022)

Licence

Attribution

Identifiers

Cite

Roberto Gorrieri. Branching Place Bisimilarity: A Decidable Behavioral Equivalence for Finite Petri Nets with Silent Moves. 41th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE), Jun 2021, Valletta, Malta. pp.80-99, ⟨10.1007/978-3-030-78089-0_5⟩. ⟨hal-03740270⟩
9 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More