Abstract
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 [10]. © 2008 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Vanhatalo, J., Völzer, H., Leymann, F., & Moser, S. (2008). Automatic workflow graph refactoring and completion. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5364 LNCS, pp. 100–115). Springer Verlag. https://doi.org/10.1007/978-3-540-89652-4_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
