Compiling business processes: untangling unstructured loops in irreducible flow graphs

This paper presents a systematic study of some major problems involved in the transformation of business process modelling languages to executable business process representations. A business process modelling language usually uses the simple concept of 'goto' to describe the operation sequence of a business. If a structured language is chosen as the executable representation, it is difficult to compile the unstructured goto flows into structured statements when the process model is irreducible. This paper discusses a method called Regular Expression Language (REL). REL is a method that can compile a business process model that is irreducible with unstructured loops to statements in structured languages with controlled code complexity. Examples are given for compiling models expressed as UML2 Activity Diagrams into the Business Process Execution Language for Web Services (BPEL4WS).

[1]  Octavian Patrascoiu.  Mapping EDOC to Web services using YATL , 2004 .

[2]  Marlon Dumas,et al.  Pattern Based Analysis of BPEL4WS , 2002 .

[3]  M. Chial,et al.  in simple , 2003 .

[4]  Robert E. Filman,et al.  GOTO Removal Based on Regular Expressions , 1997, J. Softw. Maintenance Res. Pract..

[5]  Timothy J. Harvey,et al.  AS imple, Fast Dominance Algorithm , 1999 .

[6]  Ralph Johnson,et al.  design patterns elements of reusable object oriented software , 2019 .

[7]  Zahira Ammarguellat,et al.  A Control-Flow Normalization Algorithm and Its Complexity , 1992, IEEE Trans. Software Eng..

[8]  Corrado Böhm,et al.  Flow diagrams, turing machines and languages with only two formation rules , 1966, CACM.

[9]  Octavian Patrascoiu.  Mapping EDOC to Web services using YATL , 2004, Proceedings. Eighth IEEE International Enterprise Distributed Object Computing Conference, 2004. EDOC 2004..

[10]  Simon K. Johnston,et al.  Business Processes Definition Metamodel Concepts and Overview , 2004 .

[11]  Vivek Sarkar,et al.  Decentralizing execution of composite web services , 2004, OOPSLA.

[12]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[13]  Jeffrey D. Ullman,et al.  Global Data Flow Analysis and Iterative Algorithms , 1976, J. ACM.

[14]  D. Skogan,et al.  Web service composition in UML , 2004 .

[15]  Roy Grønmo,et al.  Web service composition in UML , 2004, Proceedings. Eighth IEEE International Enterprise Distributed Object Computing Conference, 2004. EDOC 2004..

[16]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[17]  Donald E. Knuth,et al.  An empirical study of FORTRAN programs , 1971, Softw. Pract. Exp..

[18]  Ken Kennedy,et al.  AS imple, Fast Dominance Algorithm , 1999 .

[19]  Jana Koehler,et al.  Untangling Unstructured Cyclic Flows - A Solution Based on Continuations , 2004, CoopIS/DOA/ODBASE.

[20]  Larry Carter,et al.  Folklore confirmed: reducible flow graphs are exponentially larger , 2003, POPL '03.

[21]  Matjaz B. Juric,et al.  Business process execution language for web services , 2004 .

[22]  Jana Koehler,et al.  Compiling Process Graphs into Executable Code , 2004, GPCE.

[23]  Tony Andrews.  Business Process Execution Language for Web Services Version 1.1 , 2003 .

[24]  Peter J. Denning,et al.  Machines, Languages, And Computation , 1978 .

[25]  Shane Sendall,et al.  Declarative techniques for model-driven business process integration , 2005, IBM Syst. J..

[26]  Robert E. Filman,et al.  GOTO removal based on regular expressions , 1997 .

[27]  David Frankel,et al.  Model Driven Architecture: Applying MDA to Enterprise Computing , 2003 .