Flexible Process Graph: A Prologue

  • Artem Polyvyanyy
  • Mathias Weske
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5331)

Abstract

Businesses document their operational processes as process models. The common practice is to represent process models as directed graphs. The nodes of a process graph represent activities and directed edges constitute activity ordering constraints. A flexible process graph modeling approach proposes to generalize process graph structure to a hypergraph. Obtained process structure aims at formalization of ad-hoc process control flow. In this paper we discuss aspects relevant to concurrent execution of process activities in a collaborative manner organized as a flexible process graph. We provide a real world flexible process scenario to illustrate the approach.

Keywords

business process modeling hypergraph-structured process ad-hoc process flexible process 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    van der Aalst, W.M.P., Berens, P.: Beyond Workflow Management: Product-Driven Case Handling (2001)Google Scholar
  2. 2.
    van der Aalst, W.M.P., Weske, M., Grunbauer, D.: Case Handling: A New Paradigm for Business Process Support (2005)Google Scholar
  3. 3.
    Basu, A., Blanning, R.: Metagraph Transformations and Workflow Management. In: HICSS 1997: Proceedings of the 30th Hawaii International Conference on System Sciences, Washington, DC, USA, 359 page. IEEE Computer Society, Los Alamitos (1997)Google Scholar
  4. 4.
    Basu, A., Blanning, R.: Metagraphs in Workflow Support Systems. Decis. Support Syst. 25(3), 199–208 (1999)CrossRefGoogle Scholar
  5. 5.
    Basu, A., Blanning, R.: A Formal Approach to Workflow Analysis. Info. Sys. Research 11(1), 17–36 (2000)CrossRefGoogle Scholar
  6. 6.
    Basu, A., Blanning, R.: Workflow Analysis using Attributed Metagraphs. In: HICSS 2001: Proceedings of the 34th Annual Hawaii International Conference on System Sciences (HICSS-34), Washington, DC, USA, vol. 9, page 9040. IEEE Computer Society, Los Alamitos (2001)Google Scholar
  7. 7.
    Berge, C.: Graphs and Hypergraphs. Elsevier Science Ltd., Amsterdam (1985)MATHGoogle Scholar
  8. 8.
    Berge, C.: Hypergraphs: The Theory of Finite Sets. North-Holland, Amsterdam (1989)MATHGoogle Scholar
  9. 9.
    Davenport, T.: Process Innovation: Reengineering Work through Information Technology. Harvard Business School Press, Boston (1993)Google Scholar
  10. 10.
    Günther, C.W., van der Aalst, W.M.P.: Modeling the Case Handling Principles with Colored Petri Nets.Google Scholar
  11. 11.
    Hammer, M., Champy, J.: Reengineering the Corporation: A Manifesto for Business Revolution (April 1994)Google Scholar
  12. 12.
    Petri, C.A.: Kommunikation mit Automaten. PhD thesis, University of Bonn, Bonn, Germany (in German) (1962)Google Scholar
  13. 13.
    Polyvyanyy, A., Weske, M.: Hypergraph-based Modeling of Ad-Hoc Business Processes. In: Proceedings of the 1st International Workshop on Process Management for Highly Dynamic and Pervasive Scenarios, Milan, Italy (September 2008)Google Scholar
  14. 14.
    Reijers, H.A., Rigter, J., van der Aalst, W.M.P.: The Case Handling Case (2003)Google Scholar
  15. 15.
    Weske, M.: Business Process Management: Concepts, Languages, Architectures. Springer, Heidelberg (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Artem Polyvyanyy
    • 1
  • Mathias Weske
    • 1
  1. 1.Business Process Technology GroupHasso Plattner Institute at the University of PotsdamPotsdamGermany

Personalised recommendations