Abstract
We present a novel transformation method that allows us to map unstructured cyclic business process models to functionally equivalent workflow specifications that support structured cycles only. Our solution is based on a continuation semantics, which we developed for the graphical representation of a process model. By using a rule-based transformation method originally developed in compiler theory, we can untangle the unstructured flow while solving a set of abstract continuation equations. The generated workflow code can be optimized by controlling the order in which the transformation rules are applied.
We then present an implementation of the transformation method that directly manipulates an object-oriented model of the Business Process Execution Language for Web Services BPEL4WS. The implementation maps abstract continuation equations to the BPEL4WS control-flow graph. The transformation rules manipulate the links in the graph such that all cycles are removed and replaced by equivalent structured activities. A byproduct of this work is that, if a continuation semantics is adopted for BPEL4WS, its restriction to acyclic links can be dropped.
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
Andrews, T., et al.: Business process execution language for web services (2002), www-106.ibm.com/developerworks/webservices/library/ws-bpel/
Rumbaugh, J., Jacobson, I., Booch, G.: The Unified Modeling Language Reference Manual. Addison Wesley, Reading (1898)
van der Aalst, W., van Hee, K.: Workflow Management Models, Methods, and Systems. MIT Press, Cambridge (2004)
van der Aalst, W., Desel, J., Kindler, E.: On the semantics of EPCs: A vicious circle. In: Proceedings of theWorkshop on EPK, pp. 7–18 (2003)
Reynolds, J.: The discoveries of continuations. LISP and Symbolic Computation 6, 233–247 (1993)
Reynolds, J.: Theories of Programming Languages. Cambridge University Press, Cambridge (1998)
Böhm, C., Jacopini, G.: Flow diagrams, turing machines and languages with only two formation rules. Communications of the ACM 9, 366–371 (1966)
Ammarguellat, Z.: A control-flow normalization algorithm and its complexity. Software Engineering 13, 237–251 (1992)
Erosa, A., Hendren, L.: Taming control flow: A structured approach to eliminating goto statements. In: Proceedings of the International Conference on Computer Languages (ICCL), pp. 229–240. IEEE Press, Los Alamitos (1994)
Peterson, W., Kasami, T., Tokura, N.: On the capabilities of while, repeat, and exit statements. Communications of the ACM 16, 503–512 (1973)
Hecht, M., Ullman, J.: Flow graph reducibility. SIAM Journal of Computing 1, 188–202 (1972)
Hauser, R., Koehler, J.: Compiling process graphs into executable code. In: Third International Conference on Generative Programming and Component Engineering. LNCS, Springer, Heidelberg (2004) (forthcoming)
Aho, A., Sethi, R., Ullman, J.: Compilers–Principles, Techniques, and Tools. Addison-Wesley, Reading (1986)
Amsden, J., Gardner, T., Griffin, C., Iyengar, S., Knapman, J.: UML profile for automated business processes with a mapping to BPEL 1.0. IBM Alphaworks, http://dwdemos.alphaworks.ibm.com/wstk/common/wstkdocservices/demos/uml2bpel/docs/ UMLProfileForBusinessProcesses1.0.pdf (2003)
Warmer, J., Kleppe, A.: The Object Constraint Language – Precise Modeling with UML. Addison-Wesley, Reading (1999)
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
Koehler, J., Hauser, R. (2004). Untangling Unstructured Cyclic Flows – A Solution Based on Continuations. In: Meersman, R., Tari, Z. (eds) On the Move to Meaningful Internet Systems 2004: CoopIS, DOA, and ODBASE. OTM 2004. Lecture Notes in Computer Science, vol 3290. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30468-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-30468-5_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23663-4
Online ISBN: 978-3-540-30468-5
eBook Packages: Springer Book Archive