Abstract
Workflow nets are recognized as a modelling paradigm for the business process modelling. We introduce and investigate several correctness notions for workflow nets, ranging from proper termination of cases to their mutual independence. We define refinement operators for nets and investigate preservation of correctness through these operators. This gives rise to a class of nets that are provably correct.
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.
Similar content being viewed by others
References
W.M.P. van der Aalst. Verification of Workflow Nets. In Azéma, P. and Balbo, G., editors, Proceedings ATPN’ 97, LNCS 1248, Springer 1997.
W.M.P. van der Aalst, J. Desel and A. Oberweis, editors Business Process Management, Models, Techniques and Empirical Studies. LNCS 1806, Springer 1998.
W.M.P. van der Aalst and K.M. van Hee. Workflow Management: models, methods and systems. The MIT Press, 2000.
W.M.P. van der Aalst. Workflow Verification: Finding Control-Flow Errors using Petri-net-based techniques. In J. Desel and A. Oberweis, editors Business Process Management, Models, Techniques and Empirical Studies. LNCS 1806, Springer 1998 [2], pages 161–183.
S. Ceri and G. Pelagatti. Distributed Databases: Principles and Systems. McGraw-Hill 1984.
P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximaton of fixpoints. In Fourth Annual Symposium on Principles of Programming Languages (POPL) (Los Angeles, Ca), pages 238–252. ACM, January 1977.
J. Dehnert and P. Rittgen. Relaxed Soundness of Business Processes. In K.R. Dittrich, A. Geppert and M.C. Norrie, editors, Proceedings CAISE’ 01, LNCS 2068, pages 157–170, Springer 2001.
J. Desel and J. Esparza. Free Choice Petri Nets. Cambridge University Press, 1995.
R.J. van Glabbeek and R.P. Weijland. Branching Time and Abstraction in Bisimulation Semantics (extended abstract). In G.X. Ritter, editor, Proceedings IFIP’ 89, pages 613–618. North Holland 1989.
E. Kindler, A. Martens and W. Reisig. Inter-operability of Workflow Applications: Local Criteria for Global Soundness. In J. Desel and A. Oberweis, editors Business Process Management, Models, Techniques and Empirical Studies. LNCS 1806, Springer 1998 [2], pages 235–253.
R. Milner. Operational and algebraic semantics of concurrent processes. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, vol. B, chapter 19, pages 1201–1242. Elsevier Science, 1990.
H.M.W. Verbeek, T. Basten, and W.M.P. van der Aalst. Diagnosing workflow processes using Woflan. The Computer Journal, 44(4):246–279, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Hee, K., Sidorova, N., Voorhoeve, M. (2003). Soundness and Separability of Workflow Nets in the Stepwise Refinement Approach. In: van der Aalst, W.M.P., Best, E. (eds) Applications and Theory of Petri Nets 2003. ICATPN 2003. Lecture Notes in Computer Science, vol 2679. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44919-1_22
Download citation
DOI: https://doi.org/10.1007/3-540-44919-1_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40334-0
Online ISBN: 978-3-540-44919-5
eBook Packages: Springer Book Archive