2023/05/07 by Roberto Gorrieri, Gorrieri, Roberto
Business, Management and Accounting · Computer Science · #68Q55 #68Q85 #Business Process Modeling and Analysis #D.2.4 #F.1.1 #F.3.1 #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Petri Nets in System Modeling #Service-Oriented Architecture and Web Services
paper · pdf · doi:10.48550/arxiv.2305.04222
openalex publication_date 2023/05/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Place bisimilarity is a behavioral equivalence for finite Petri nets, proposed in \citeABS91 and proved decidable in \citeGor21. In this paper we propose an extension to finite Petri nets with silent moves of the place bisimulation idea, yielding \em branching place bisimilarity ≈p, following the intuition of branching bisimilarity \citevGW96 on labeled transition systems. We also propose a slightly coarser variant, called branching \em d-place bisimilarity ≈d, following the intuition of d-place bisimilarity in \citeGor21. We prove that ≈p and ≈d are decidable equivalence relations. Moreover, we prove that ≈d is strictly finer than branching fully-concurrent bisimilarity \citePin93,Gor20c, essentially because ≈d does not consider as unobservable those τ-labeled net transitions with pre-set size larger than one, i.e., those resulting from (multi-party) interaction.