Abstract
We improve the decision procedure from [10] for the problem of generalized soundness of workflow nets. A workflow net is generalized sound iff every marking reachable from an initial marking with k tokens on the initial place terminates properly, i.e. it can reach a marking with k tokens on the final place, for an arbitrary natural number k. Our new decision procedure not only reports whether the net is sound or not, but also returns a counterexample in case the workflow net is not generalized sound. We report on experimental results obtained with the prototype we made and explain how the procedure can be used for the compositional verification of large workflows.
This is a preview of subscription content, log in via an institution to check access.
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.: The Application of Petri Nets to Workflow Management. The Journal of Circuits, Systems and Computers 8(1), 21–66 (1998)
van der Aalst, W.M.P., van Hee, K.M.: Workflow Management: Models, Methods, and Systems. MIT Press, Cambridge (2002)
Bagnara, R., Hill, P., Zaffanela, E.: The Parma Polyhedra Library user’s manual. Department of Mathematics, University of Parma, Italy. http://www.cs.unipr.it/ppl/Documentation
Bagnara, R., et al.: Possibly not closed convex polyhedra and the Parma Polyhedra Library. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol. 2477, pp. 213–229. Springer, Heidelberg (2002)
Berthelot, G.: Verification de Reseaux de Petri. PhD thesis, Universite Pierre et Marie Curie, Paris (1978)
Commoner, F.: Deadlocks in Petri Nets. Report CA-7206-2311, Applied Data Research, Inc., Wakefield, Massachusetts (1972)
de Frutos Escrig, D., Johnen, C.: Decidability of home space property. Technical report, Univ. de Paris-Sud, Centre d’Orsay, Laboratoire de Recherche en Informatique Report LRI–503 (July 1989)
Desel, J., Esparza, J.: Free Choice Petri nets. Cambridge Tracts in Theoretical Computer Science, vol. 40. Cambridge University Press, Cambridge (1995)
van Hee, K., Sidorova, N., Voorhoeve, M.: Soundness and separability of workflow nets in the stepwise refinement approach. In: van der Aalst, W.M.P., Best, E. (eds.) ICATPN 2003. LNCS, vol. 2679, pp. 337–356. Springer, Heidelberg (2003)
van Hee, K., Sidorova, N., Voorhoeve, M.: Generalized soundness of workflow nets is decidable. In: Cortadella, J., Reisig, W. (eds.) ICATPN 2004. LNCS, vol. 3099, pp. 197–216. Springer, Heidelberg (2004)
Mayr, E.W.: An algorithm for the general Petri net reachability problem. In: Conference Proceedings of the 13th Annual ACM Symposium on Theory of Computation, STOC’1981, pp. 238–246. ACM Press, New York (1981)
Murata, T.: Petri nets: Properties, analysis and applications. Proceedings of the IEEE 7(4), 541–580 (1989)
Ping, L., Hao, H.: On 1-soundness and soundness of workflow nets. In: Third Workshop on Modelling of Objects, Components, and Agents Aarhus, Denmark, October 11-13, 2004, pp. 21–36 (2004)
Post, R.: YASPER Petri net editor. Department of Mathematics and Computer Science, Technical University Eindhoven, The Netherlands, http://www.yasper.org
Reutenauer, C.: The mathematics of Petri nets. Prentice-Hall, Englewood Cliffs (1990)
Schrijver, A.: Theory of Linear and Integer Programming. Wiley-Interscience series in discrete mathematics. Wiley, Chichester (1986)
Tiplea, F.L., Marinescu, D.C.: Structural soundness for workflow nets is decidable. Information Processing Letters 96(2), 54–58 (2005)
Vogler, W.: Behaviour preserving refinement of Petri nets. In: Tinhofer, G., Schmidt, G. (eds.) WG 1986. LNCS, vol. 246, pp. 82–93. Springer, Heidelberg (1987)
Vogler, W.: Modular Construction and Partial Order Semantics of Petri Nets. LNCS, vol. 625. Springer, Heidelberg (1992)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Hee, K., Oanea, O., Sidorova, N., Voorhoeve, M. (2007). Verifying Generalized Soundness of Workflow Nets. In: Virbitskaite, I., Voronkov, A. (eds) Perspectives of Systems Informatics. PSI 2006. Lecture Notes in Computer Science, vol 4378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70881-0_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-70881-0_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70880-3
Online ISBN: 978-3-540-70881-0
eBook Packages: Computer ScienceComputer Science (R0)