%0 Conference Proceedings
%T On the Step Branching Time Closure of Free-Choice Petri Nets
%+ Technische Universität Braunschweig = Technical University of Braunschweig [Braunschweig]
%A Mennicke, Stephan
%A Schicke-Uffmann, Jens-Wolfhard
%A Goltz, Ursula
%Z Part 4: Bisimulation, Abstraction and Reduction
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 34th Formal Techniques for Networked and Distributed Systems (FORTE)
%C Berlin, Germany
%Y Erika Ábrahám
%Y Catuscia Palamidessi
%I Springer
%3 Formal Techniques for Distributed Objects, Components, and Systems
%V LNCS-8461
%P 232-248
%8 2014-06-03
%D 2014
%R 10.1007/978-3-662-43613-4_15
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01398018/document
%2 https://inria.hal.science/hal-01398018/file/978-3-662-43613-4_15_Chapter.pdf
%L hal-01398018
%U https://inria.hal.science/hal-01398018
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-FORTE
%~ IFIP-LNCS-8461