Abstract
In the paper we discuss the event-driven reactive programs and systems, which does not deadlock for one instance, but because of shared resources, can deadlock for several instances. We focus on event-driven programs, where instances have a correct finish, and resources can be used by single instances, but can neither be destroyed nor created by instances. Typical examples include workflow processes, where each case creates an instance of the process and instances share resources used to execute single activities. Formally, we model such event-driven programs and systems by workflow nets, enriched by so called static places, introduced in [3] as resource constrained workflow nets (rcwf-nets). We investigate, whether an rcwf-net, which is sound for a single instance is sound for multiple instances (dynamically sound) or whether it contains an instance deadlock for a number of instances. We show that the detection of instance deadlock and the dynamic soundness of rcwf-nets is decidable by transforming the problem to bounded place/transition Petri nets.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
van der Aalst, W.M.P., van Hee, K.: Workflow Management, Models Methods and Systems. The MIT Press, Cambridge (2002)
Esparza, J., Nielsen, M.: Decidability issues for Petri nets–a survey. J. Inform. Process. Cybernet. 30(3), 143–160 (1994)
van Hee, K.M., Serebrenik, A., Sidorova, N., Voorhoeve, M.: Soundness of Resource-Constrained Workflow Nets. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 250–267. Springer, Heidelberg (2005)
Medling, J., van der Aalst, W.M.P.: Errors in the SAP Reference Models. BPTrends (June 2006)
Desel, J., Juhás, G.: What is a Petri Net? In: Ehrig, H., Juhás, G., Padberg, J., Rozenberg, G. (eds.) APN 2001. LNCS, vol. 2128, pp. 1–25. Springer, Heidelberg (2001)
Jensen, K.: Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use I II III. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Juhás, G., Kazlov, I., Juhásová, A. (2010). Instance Deadlock: A Mystery behind Frozen Programs. In: Lilius, J., Penczek, W. (eds) Applications and Theory of Petri Nets. PETRI NETS 2010. Lecture Notes in Computer Science, vol 6128. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13675-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-13675-7_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13674-0
Online ISBN: 978-3-642-13675-7
eBook Packages: Computer ScienceComputer Science (R0)