On the Step Branching Time Closure of Free-Choice Petri Nets

Free-choice Petri nets constitute a non-trivial subclass of Petri nets, excelling in simplicity as well as in analyzability. Extensions of free-choice nets have been investigated and shown to be translatable back to interleaving-equivalent free-choice nets. In this paper, we investigate extensions of free-choice Petri nets up to step branching time equivalences. For extended free-choice nets, we achieve a generalization of the equivalence result by showing that an existing construction respects weak step bisimulation equivalence. The known translation for behavioral free-choice does not respect step branching time equivalences, which turns out to be a property inherent to all transformation functions from this net class into (extended) free-choice Petri nets. By analyzing the critical structures, we find two subsets of behavioral free-choice nets that are step branching time equivalent to free-choice nets. Finally, we provide a discussion concerning the actual closure of free-choice Petri nets up to step branching time equivalences.

[1]  C. Petri.  Kommunikation mit Automaten , 1962 .

[2]  Grzegorz Rozenberg,et al.  Petri Nets: Basic Notions, Structure, Behaviour , 1986, Current Trends in Concurrency.

[3]  Eike Best.  Structure Theory of Petri Nets: the Free Choice Hiatus , 1986 .

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

[5]  Grzegorz Rozenberg,et al.  Current Trends in Concurrency , 1986, Lecture Notes in Computer Science.

[6]  Eike Best,et al.  Structure Theory of Petri Nets , 2013, Trans. Petri Nets Other Model. Concurr..

[7]  Wil M. P. van der Aalst,et al.  Transactions on Petri Nets and Other Models of Concurrency VII , 2013, Lecture Notes in Computer Science.

[8]  Jörg Desel,et al.  Free choice Petri nets , 1995 .

[9]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum II , 1993, CONCUR.

[10]  Grzegorz Rozenberg,et al.  Advances in Petri Nets 1985 , 1985, Lecture Notes in Computer Science.

[11]  Ursula Goltz,et al.  On Characterising Distributability , 2013, Log. Methods Comput. Sci..

[12]  Ursula Goltz,et al.  Symmetric and Asymmetric Asynchronous Interaction , 2008, ICE@ICALP.

[13]  Wolfgang Reisig,et al.  Lectures on Petri Nets I: Basic Models , 1996, Lecture Notes in Computer Science.

[14]  Ursula Goltz,et al.  Abstract processes of place/transition systems , 2011, Inf. Process. Lett..

[15]  Guy Vidal-Naquet.  Deterministic Languages of Petri Nets , 1981, Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets.

[16]  Ursula Goltz,et al.  On Synchronous and Asynchronous Interaction in Distributed Systems , 2008, MFCS.

[17]  Javier Esparza,et al.  Decidability and Complexity of Petri Net Problems - An Introduction , 1996, Petri Nets.

[18]  Jerzy Tyszkiewicz,et al.  Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings , 2008, MFCS.

[19]  Wolfgang Reisig,et al.  Application and Theory of Petri Nets , 1982, Informatik-Fachberichte.

[20]  Eike Best,et al.  Some Equivalence Results for Free Choice Nets and Simple Nets and on the Periodicity of Live Free Choice Nets , 1983, CAAP.