Abstract
This paper introduces a novel method of verifying a cyclic workflow model by partitioning it into acyclic subgraphs. The iterative classification of nodes according to the feedback structure and derivation of acyclic subgraphs are illustrated. We also introduce the concepts of two-phased verification of control flows and decomposition-oriented analysis, which is generally easier to comprehend and verify individually than the whole workflow model.
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
Similar content being viewed by others
References
van der Aalst, W.M.P.: The Application of Petri Nets to Workflow Management. J. Circuits, Systems and Computers 8, 21–66 (1998)
Lin, H., Zhao, Z., Li, H., Chen, Z.: A novel graph reduction algorithm to identify structural conflicts. In: Proc. 35th Hawaii Int. Conf. On Sys. Sci (HICSS 2002), vol. 9, p. 289 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Choi, Y., Zhao, J.L. (2004). Feedback Partitioning and Decomposition-Oriented Analysis of Cyclic Workflow Graphs. In: Meersman, R., Tari, Z., Corsaro, A. (eds) On the Move to Meaningful Internet Systems 2004: OTM 2004 Workshops. OTM 2004. Lecture Notes in Computer Science, vol 3292. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30470-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-30470-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23664-1
Online ISBN: 978-3-540-30470-8
eBook Packages: Springer Book Archive