Resource Bisimilarity in Petri Nets is Decidable

Petri nets are a popular formalism for modeling and analyzing distributed systems. Tokens in Petri net models can represent the control flow state or resources produced/consumed by transition firings. We define a resource as a part (submultiset) of the Petri net marking and call two resources equivalent iff replacing one of them with another in any marking does not change the observable Petri net behavior. We investigate the resource similarity and the resource bisimilarity — congruent restrictions of the bisimulation equivalence on Petri net markings and prove that the resource bisimilarity is decidable in contrast to the resource similarity.

[1]  Raymond R. Devillers,et al.  Application and Theory of Petri Nets and Concurrency , 2015, Lecture Notes in Computer Science.

[2]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[3]  Rocco De Nicola,et al.  Models of Nondeterministic Regular Expressions , 1999, J. Comput. Syst. Sci..

[4]  Vladimir A. Bashkin,et al.  Decidability of k -Soundness for Workflow Nets with an Unbounded Resource , 2014, Trans. Petri Nets Other Model. Concurr..

[5]  Irina A. Lomazova,et al.  Resource Equivalences in Petri Nets , 2017, Petri Nets.

[6]  Philippe Schnoebelen,et al.  Strong Bisimilarity on Nets Revisited , 1991, PARLE.

[7]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[8]  Grzegorz Rozenberg,et al.  Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency , 1988, Lecture Notes in Computer Science.

[9]  Petr Jancar.  Undecidability of Bisimilarity for Petri Nets and Some Related Problems , 1995, Theor. Comput. Sci..

[10]  Philippe Schnoebelen,et al.  Well-structured transition systems everywhere! , 2001, Theor. Comput. Sci..

[11]  Reiko Heckel,et al.  Open Petri Nets as Semantic Model for Workflow Integration , 2003, Petri Net Technology for Communication-Based Systems.

[12]  Natalia Sidorova,et al.  Soundness for Resource-Constrained Workflow Nets Is Decidable , 2013, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[13]  Roberto Gorrieri.  Team bisimilarity, and its associated modal logic, for BPP nets , 2020, Acta Informatica.

[14]  Daniele Varacca,et al.  Place Bisimulation and Liveness for Open Petri Nets , 2016, SETTA.

[15]  L. Rédei,et al.  The theory of finitely generated commutative semigroups , 1965 .

[16]  Graham Higman,et al.  Ordering by Divisibility in Abstract Algebras , 1952 .

[17]  Wolfgang Thomas,et al.  On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science , 1993, TAPSOFT.

[18]  Luca Aceto,et al.  The algorithmics of bisimilarity , 2012, Advanced Topics in Bisimulation and Coinduction.

[19]  Luca Aceto,et al.  Advanced Topics in Bisimulation and Coinduction , 2012, Cambridge tracts in theoretical computer science.

[20]  Ali Kashif Bashir,et al.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , 2013, ICIRA 2013.

[21]  Vladimir A. Bashkin,et al.  Similarity of Generalized Resources in Petri Nets , 2005, PaCT.

[22]  Vladimir A. Bashkin,et al.  Resource Similarities in Petri Net Models of Distributed Systems , 2003 .

[23]  Philippe Schnoebelen,et al.  Bisimulation and the Reduction of Petri Nets , 2000, ICATPN.

[24]  M. Voorhoeve.  Structural Petri net equivalence , 1996 .

[25]  Ernst-Rüdiger Olderog,et al.  Strong bisimilarity on nets: a new concept for comparing net semantics , 1988, REX Workshop.

[26]  Petr Jancar,et al.  Selected Ideas Used for Decidability and Undecidability of Bisimilarity , 2008, Developments in Language Theory.

[27]  Philippe Schnoebelen,et al.  Place Bisimulations in Petri Nets , 1992, Application and Theory of Petri Nets.

[28]  Berndt Farwer.  A Linear Logic View of Object Petri Nets , 1999, Fundam. Informaticae.

[29]  C Autant,et al.  Place Bisimulations for the Reduction of Labeled Petri Nets with Silent Moves , 1994 .

[30]  Irina A. Lomazova,et al.  Analyzing Compatibility of Services via Resource Conformance , 2013, Fundam. Informaticae.

[31]  Irina A. Lomazova,et al.  A Systematic Approach towards Object-Based Petri Net Formalisms , 2001, Ershov Memorial Conference.

[32]  Fabio Gadducci,et al.  Modular encoding of synchronous and asynchronous interactions using open Petri nets , 2015, Sci. Comput. Program..

[33]  Roberto Gorrieri.  A Study on Team Bisimulations for BPP Nets , 2020, Petri Nets.

[34]  Colin Stirling,et al.  Local model checking games (extended abstract) , 1995 .

[35]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[36]  Søren Christensen.  Decidability and decomposition in process algebras , 1993 .

[37]  Faron Moller,et al.  Bisimulation Equivalence is Decidable for Basic Parallel Processes , 1993, CONCUR.

[38]  Vladimir A. Bashkin,et al.  Petri nets and resource bisimulation , 2003, Fundam. Informaticae.

[39]  R. J. vanGlabbeek.  The linear time - branching time spectrum , 1990 .