Automatic Workflow Graph Refactoring and Completion
Workflow graphs are used to model the control flow of business processes in various languages, e.g., BPMN, EPCs and UML activity diagrams. We present techniques for automatic workflow graph refactoring and completion. These techniques enable various use cases in modeling and runtime optimization. For example they allow us to complete a partial workflow graph, they provide local termination detection for workflow graphs with multiple ends, and they allow us to execute models containing OR-joins faster. Some of our techniques are based on workflow graph parsing and the Refined Process Structure Tree .
- 1.Ananian, C.S.: The static single information form. Master’s thesis, Massachusetts Institute of Technology (September 1999)Google Scholar
- 2.Eder, J., Gruber, W., Pichler, H.: Transforming workflow graphs. In: INTEROP-ESA 2005, pp. 203–214 (2005)Google Scholar
- 3.Alves, A., et al.: Web Services Business Process Execution Language Version 2.0. OASIS Org. (2007)Google Scholar
- 5.Johnson, R., Pearson, D., Pingali, K.: The program structure tree: Computing control regions in linear time. In: PLDI 1994, pp. 171–185. ACM, New York (1994)Google Scholar
- 12.Vanhatalo, J., Völzer, H., Leymann, F., Moser, S.: Automatic workflow graph refactoring and completion. IBM Research Report RZ 3715 (2008)Google Scholar