Free-Choice Petri Nets without Frozen Tokens, and Bipolar Synchronization Systems
Pages 283 - 320
Abstract
Bipolar synchronization systems (BP-systems) constitute a class of coloured Petri nets, well suited for modelling the control flow of discrete dynamical systems. Every BP-system has an underlying ordinary Petri net, a T-system. It further has a second ordinary net attached, a free-choice system. We prove that a BP-system is safe and live if the T-system and the free-choice system are safe and live and the free-choice system in addition has no frozen tokens. This result is the converse of a theorem of Genrich and Thiagarajan and proves an old conjecture. As a consequence we obtain two results about the existence of safe and live BP-systems with prescribed ordinary Petri nets. For the proof of these theorems we introduce the concept of a morphism between Petri nets as a means of comparing different Petri nets. We then apply the classical theory of free-choice systems.
References
[1]
Best, Eike; Desel, Jörg: Partial Order Behaviour and Structure of Petri Nets. Formal Aspects of Computing (1990), p. 123-138.
[2]
Desel, Jörg: A structural property of Free-choice Systems. Petri Net Newsletter 25, 1986.
[3]
Desel, Jörg, Esparza, Javier: Free Choice Petri Nets. Cambridge University Press, Cambridge 1995.
[4]
Esparza, Javier; Silva, Manuel: Circuits, Handles, Bridges and Nets. In: Rozenberg, Grzegorz (Ed.) Advances in Petri nets 1990. Lecture Notes in Computer Science, vol. 483, Springer, Berlin 1990, p. 210-242.
[5]
Gaujal, Bruno; Haar, Stefan; Mairesse, Jean: Blocking a transition in a Free Choice net and what it tells about its throughput. Journal of Computer and System Sciences 66 (2003), p. 515-548.
[6]
Gruhn, Volker; Laue, Ralf: Einfache EPK-Semantik durch praxistaugliche Stilregeln. In: Nüttgens, Markus; Rump, Frank (Hrsg.): EPK 2005. Geschäftsprozessmanagement mit Ereignisgesteuerten Prozessketten. Proceedings, Hamburg 2005.
[7]
Genrich, H.J.; Thiagarajan, P.S.: A Theory of Bipolar Synchronization Schemes. Theoretical Computer Science 30 (1984), p. 241-318.
[8]
Jensen, Kurt: Coloured Petri nets. Basic concepts, analysis methods and practical use. Vol. 1. Springer, Berlin et al. 1992.
[9]
Langner, Peter; Schneider, Christoph; Wehler, Joachim: Petri Net based Certification of Event-driven Process Chains. In: Desel, Jörg; Silva, Manuel (Eds.): Application and Theory of Petri Nets 1998. Lecture notes in Computer science, vol. 1420. Springer, Berlin et al. 1998.
[10]
Mendling, Jan; van der Aalst, Wil: Towards EPC Semantics based on State and Context. In: Nüttgens, Markus; Rump, Frank: EPK 2006. Geschäftsprozessmanagement mit Ereignisgesteuerten Prozessketten. 5. Workshop der Gesellschaft für Informatik, Wien, 2006.
[11]
Scheer, August-Wilhelm: Business Process Engineering. Reference Models for Industrial Enterprises. Springer, Berlin et al. 1994.
[12]
Thiagarajan, P.S.; Voss, Klaus: A Fresh Look at Free Choice Nets. Information and Control 62 (1984), p. 85-113.
[13]
Wehler, Joachim: Morphisms of Coloured Petri Nets, arXiv, cs.SE/0608038, 2006.
[14]
Wehler, Joachim: Boolean and free-choice semantics of Event-driven Process Chains. EPK 2007. In: Nüttgens, Markus; Rump, Frank, Gadatsch, Andreas (Eds.): 6. GI-Workshop EPK 2007: Geschäftsprozessmanagementmit Ereignisgesteuerten Prozessketten. St. Augustin, 2007.
Recommendations
Simplified proof of the blocking theorem for free-choice Petri nets
Every cluster in a bounded and live free-choice system has a unique blocking marking. It can be reached by firing an occurrence sequence, which avoids any transition of the cluster. This theorem is due to Gaujal, Haar and Mairesse. We will give a short ...
Automating the Conversion of Colored Petri Nets with Qualitative Tokens Into Colored Petri Nets with Quantitative Tokens
The authors describe an algorithm for conversion of colored Petri nets with qualitative tokens into a colored Petri net with quantitative tokens preserving boundedness, mutual exclusion, and liveness properties. This conversion allows the invariance ...
Non Equivalence between Time Petri Nets and Time Stream Petri Nets
PNPM '99: Proceedings of the The 8th International Workshop on Petri Nets and Performance ModelsIt had been shown that Merlin's Time Petri Nets are a special case of Time Stream Petri Nets. In this paper, we show that it does not exist a time equivalence between both models. We extend first this result to the nonequivalence of Timed Automata and ...
Comments
Information & Contributors
Information
Published In
Publisher
IOS Press
Netherlands
Publication History
Published: 01 April 2010
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 29 Jul 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in