Untangling unstructured cyclic flows - A solution based on continuations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3290, Issue , 2004, Pages 121-138

  Koehler, Jana ^a   Hauser, Rainer ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; DATA FLOW ANALYSIS; DISTRIBUTED DATABASE SYSTEMS; FLOW GRAPHS; GRAPHIC METHODS; MULTI AGENT SYSTEMS; PROGRAM COMPILERS; SEMANTIC WEB; SEMANTICS;

BUSINESS PROCESS EXECUTION LANGUAGE FOR WEB SERVICES; BUSINESS PROCESS MODEL; CONTINUATION SEMANTICS; GRAPHICAL REPRESENTATIONS; OBJECT ORIENTED MODEL; RULE-BASED TRANSFORMATION; TRANSFORMATION METHODS; WORKFLOW SPECIFICATION;

WEB SERVICES;

EID: 35048863598     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30468-5_10     Document Type: Article

References (15)

1. Andrews, T., et al.: Business process execution language for web services. www-106.ibm.com/developerworks/webservices/library/ws-bpel/(2002)
2. Rumbaugh, J., Jacobson, I., Booch, G.: The Unified Modeling Language Reference Manual. AddisonWesley(1898)
3. van der Aalst, W., van Hee, K.: Workflow Management Models, Methods, and Systems. MIT Press (2004)
4. van der Aalst, W., Desel, J., Kindler, E.: On the semantics of EPCs: A vicious circle. In: Proceedings of the Workshop on EPK. (2003) 7-18
5. Reynolds, J.: The discoveries of continuations. LISP and Symbolic Computation 6 (1993) 233-247
6. Reynolds, J.: Theories of Programming Languages. Cambridge University Press (1998)
7. Böhm, C., Jacopini, G.: Flow diagrams, luring machines and languages with only two formation rules. Communications of the ACM 9 (1966) 366-371
8. Ammarguellat, Z.: A control-flow normalization algorithm and its complexity. Software Engineering 13 (1992) 237-251
9. Erosa, A., Hendren, L.: Taming control flow: A structured approach to eliminating goto statements. In: Proceedings of the International Conference on Computer Languages (ICCL, IEEE Press (1994) 229-240
10. Peterson, W., Kasami, T.,Tokura, N.: On the capabilities of while, repeat, and exit statements. Communications of the ACM 16 (1973) 503-512
11. Hecht, M., Ullman, J.: Flow graph reducibility. SIAM Journal of Computing 1 (1972) 188-202
12. Hauser, R., Koehler, J.: Compiling process graphs into executable code. In: Third International Conference on Generative Programming and Component Engineering. LNCS, Springer (2004) forthcoming.
13. Aho, A., Sethi, R., Ullman, J.: Compilers-Principles, Techniques, and Tools. Addison-Wesley (1986)
14. 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://dwdcmos.alphaworks.ibm.com/ wstk/ common/ wstkdoc/ services/ demos/ uml2bpel/ docs/ UMLProfileForBusinessProcesses1.0.pdf (2003)
15. Warmer, J., Kleppe, A.: The Object Constraint Language -Precise Modeling with UML. Addison-Wesley (1999)