Advertisement

Automatic Workflow Graph Refactoring and Completion

  • Jussi Vanhatalo
  • Hagen Völzer
  • Frank Leymann
  • Simon Moser
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5364)

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].

References

  1. 1.
    Ananian, C.S.: The static single information form. Master’s thesis, Massachusetts Institute of Technology (September 1999)Google Scholar
  2. 2.
    Eder, J., Gruber, W., Pichler, H.: Transforming workflow graphs. In: INTEROP-ESA 2005, pp. 203–214 (2005)Google Scholar
  3. 3.
    Alves, A., et al.: Web Services Business Process Execution Language Version 2.0. OASIS Org. (2007)Google Scholar
  4. 4.
    Gschwind, T., Koehler, J., Wong, J.: Applying patterns during business process modeling. In: Dumas, M., Reichert, M., Shan, M.-C. (eds.) BPM 2008. LNCS, vol. 5240, pp. 4–19. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  5. 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
  6. 6.
    Kiepuszewski, B., ter Hofstede, A.H.M., Bussler, C.: On structured workflow modelling. In: Wangler, B., Bergman, L.D. (eds.) CAiSE 2000. LNCS, vol. 1789, pp. 431–445. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  7. 7.
    Murata, T.: Petri nets: Properties, analysis and applications. Proceedings of the IEEE 77(4), 541–580 (1989)CrossRefGoogle Scholar
  8. 8.
    Sadiq, W., Orlowska, M.E.: Analyzing process models using graph reduction techniques. Inf. Syst. 25(2), 117–134 (2000)CrossRefGoogle Scholar
  9. 9.
    van der Aalst, W.M.P., Hirnschall, A., Verbeek, H.M.W.: An alternative way to analyze workflow graphs. In: Pidduck, A.B., Mylopoulos, J., Woo, C.C., Ozsu, M.T. (eds.) CAiSE 2002. LNCS, vol. 2348, pp. 535–552. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  10. 10.
    Vanhatalo, J., Völzer, H., Koehler, J.: The refined process structure tree. In: Dumas, M., Reichert, M., Shan, M.-C. (eds.) BPM 2008. LNCS, vol. 5240, pp. 100–115. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  11. 11.
    Vanhatalo, J., Völzer, H., Leymann, F.: Faster and more focused control-flow analysis for business process models through SESE decomposition. In: Krämer, B.J., Lin, K.-J., Narasimhan, P. (eds.) ICSOC 2007. LNCS, vol. 4749, pp. 43–55. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  12. 12.
    Vanhatalo, J., Völzer, H., Leymann, F., Moser, S.: Automatic workflow graph refactoring and completion. IBM Research Report RZ 3715 (2008)Google Scholar
  13. 13.
    Zhang, F., D’Hollander, E.H.: Using hammock graphs to structure programs. IEEE Trans. Softw. Eng. 30(4), 231–245 (2004)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Jussi Vanhatalo
    • 1
    • 2
  • Hagen Völzer
    • 1
  • Frank Leymann
    • 2
  • Simon Moser
    • 3
  1. 1.IBM Zurich Research LaboratorySwitzerland
  2. 2.Institute of Architecture of Application SystemsUniversity of StuttgartGermany
  3. 3.IBM Böblingen Software LaboratoryGermany

Personalised recommendations