Article in Proceedings INPROC-2008-99

BibliographyVanhatalo, Jussi; Völzer, Hagen; Leymann, Frank; Moser, Simon: Automatic Workflow Graph Refactoring and Completion.
In: Bouguettaya, A. (ed.); Krueger, I. (ed.); Margaria, T. (ed.): ICSOC 2008.
University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology.
Lecture Notes in Computer Science; 5364, pp. 100-115, english.
Springer-Verlag, November 2008.
Article in Proceedings (Conference Paper).
CR-SchemaH.4.1 (Office Automation)
D.3 (Programming Languages)
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

Department(s)University of Stuttgart, Institute of Architecture of Application Systems
Entry dateDecember 5, 2008
   Publ. Institute   Publ. Computer Science