Compiling business processes: untangling unstructured loops in irreducible flow graphs

International Journal of Web and Grid Services

Volumn 2, Issue 1, 2006, Pages 68-91

  Zhao, Wei ^a   Hauser, Rainer ^b   Bhattacharya, Kamal ^c   Bryant, Barrett R ^a   Cao, Fei ^a  

^a UNIVERSITY OF ALABAMA AT BIRMINGHAM   (United States)

^b IBM RESEARCH ZURICH   (Switzerland)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Business Process Execution Language; business process model; compiler optimisation; irreducible loop; Model Driven Architecture (MDA); model transformation; regular expression; unstructured loop

Indexed keywords

EID: 34548095350     PISSN: 17411106     EISSN: 17411114     Source Type: Journal    
DOI: 10.1504/IJWGS.2006.008880     Document Type: Article

References (27)

1. Aho, A., Sethi, R. and Ullman, J. (1986) Compilers-Principles, Techniques, and Tools, Addison-Wesley.
2. Ammarguellat, Z. (1992) ‘A control-flow normalization algorithm and its complexity’, IEEE Transactions on Software Engineering, Vol. 18, No. 3.
3. Bohm, C. and Jacopini, G. (1966) ‘Flow diagrams, turing machines and languages with only two formation rules’, Communications of the ACM, Vol. 9, No. 5, pp.366–371.
4. Business Process Execution Language (BPEL) (2003) Business Process Execution Language for Web Services, Version 1.1, 05 May, http://www-106.ibm.com/developerworks/library/ws-bpel/
5. Carter, L., Ferrante, J. and Thomborson, C. (2003) ‘Folklore confirmed: reducible flow graphs are exponentially larger’, Proceedings of the 30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.106–114.
6. Cocke, J. and Miller, R.E. (1969) ‘Some analysis techniques for optimizing computer programs’, Proceedings of the 2nd Hawaii International Conference on Systems Sciences (HICSS), pp.143–146.
7. Cooper, K., Harvey, T. and Kennedy, K. (2001) ‘A simple, fast dominance algorithm’, Software – Practice and Experience, Vol. 31, No. 4, pp.1-10.
8. Denning, P.J., Dennis, J.B. and Qualitz, J.E. (1978) Machines, Languages, and Computation, Prentice-Hall, Inc.
9. Frankel, D.S. (2003) Model Driven Architecture: Applying MDA to Enterprise Computing, Wiley Publishing, Inc.
10. Frank, J.H., Gardner, T.A., Johnston, S.K., White, S.A. and Iyengar, S. (2004) ‘Business processes definition metamodel concepts and overview’, IBM’s Proposal in Response to the OMG’s RFP for a Business Process Definition Metamodel, http://www.bpmn.org/Documents/BPDM/BPDM%20Whitepaper%202004-05-03.pdf
11. Gamma, E., Helm, R., Johnson, R. and Vlissides, J. (1995) Design Patterns: Elements of Reusable Object-Oriented Software, Addison-Wesley.
12. Hauser, R. and Koehler, J. (2004) ‘Compiling process graphs into executable code’, Proceedings of the 3rd International Conference on Generative Programming and Component Engineering (GPCE’04), pp.317–336.
13. Hopcroft, J. and Ullman, J. (1979) Introduction to Automata Theory, Languages, and Computation, Addison-Wesley Publishing Company, Inc.
14. Kam, J. and Ullman, J. (1976) ‘Global data flow analysis and iterative algorithms’, Journal of the ACM, Vol. 23, No. 1, pp.158–171.
15. Knuth, E. (1971) ‘An empirical study of FORTRAN programs’, Software – Practice and Experience, Vol. 1, No. 2, pp.105–133.
16. Koehler, J. and Hauser, R. (2004) ‘Untangling unstructured cyclic flows – a solution based on continuations’, Proceedings of the International Conference on Cooperative Information Systems, pp.121–138.
17. Koehler, J., Hauser, R., Sendall, S. and Wahler, M. (2005) ‘Declarative techniques for model-driven business process integration’, IBM Systems Journal, Vol. 44, No. 1, pp.47–65.
18. Morris, P.H., Gray, R.A. and Filman, R.E. (1999) ‘GOTO removal based on regular expressions’, Journal of Software Maintenance: Research and Practice, Vol. 9, No. 1, pp.47–66.
19. Nanda, M.G., Chandra, S. and Sarkar, V. (2004) ‘Decentralized execution of composite web services’, Proceedings of the 19th Annual ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA).
20. Patrascoiu, O. (2004) ‘Mapping EDOC to web services using YATL’, Proceedings of the 8th International IEEE Enterprise Distributed Object Computing Conference.
21. Skogan, D., Gronmo, R. and Solheim, I. (2004) ‘Web service composition in UML’, Proceedings of the 8th International IEEE Enterprise Distributed Object Computing Conference.
22. UML2 (2003) UML 2.0 Superstructure Final Adopted Specification, ptc/03-08-02, http://www.omg.org/cgi-bin/doc?ptc/2003-08-02
23. Wohed, P., van der Aalst, W.M.P., Dumas, M. and ter Hofstede, A.H.M. (2002) ‘Pattern-based analysis of BPEL4WS’, QUT Technical Report, FIT-TR-2002-04, Queensland University of Technology.
24. We should be careful that a direct XML encoding of a graph is not a linearisation of the graph as the encoding is still semantically two dimensional.
25. http://www.gentleware.com/index.php
26. http://www.omg.org/technology/documents/formal/xmi.htm
27. http://tmitwww.tm.tue.nl/research/patterns/standards.htm