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

Abstract : 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.
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/hal-01398018
Contributor : Hal Ifip <>
Submitted on : Wednesday, November 16, 2016 - 3:38:20 PM
Last modification on : Wednesday, November 16, 2016 - 4:23:24 PM
Long-term archiving on : Thursday, March 16, 2017 - 4:26:36 PM

File

978-3-662-43613-4_15_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Stephan Mennicke, Jens-Wolfhard Schicke-Uffmann, Ursula Goltz. On the Step Branching Time Closure of Free-Choice Petri Nets. 34th Formal Techniques for Networked and Distributed Systems (FORTE), Jun 2014, Berlin, Germany. pp.232-248, ⟨10.1007/978-3-662-43613-4_15⟩. ⟨hal-01398018⟩

Share

Metrics

Record views

116

Files downloads

85