Advertisement

Layout Techniques Coupled with Web2.0-Based Business Process Modeling

  • Philip Effinger
  • Gero Decker
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5849)

Abstract

The most wide-spread notation for process models is the Business Process Modeling Notation (BPMN). With Oryx, we have a open-source modeling tool at hand that supports collaborative and web-based modeling of BPMN diagrams. Here, we show how automatic layout of diagrams can support the designer when starting to model a process in BPMN. We provide an automatic layout integrated into Oryx that computes a new layout for a given diagram considering BPMN drawing conventions, e.g. orthogonal edges, hierarchical structures, partitions, etc.

Keywords

Activity Diagram Business Process Management Business Process Modeling Notation Scalable Vector Graphic Representational State Transfer 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Effinger, P., Kaufmann, M., Siebenhaller, M.: Enhancing visualizations of business processes. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 437–438. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  2. 2.
    Effinger, P., Siebenhaller, M., Kaufmann, M.: An Interactive Layout Tool for BPMN. In: BPMN 2009 - 1st International Workshop on BPMN, co-located with 11th IEEE Conference on Commerce and Enterprise Computing, CEC 2009 (2009)Google Scholar
  3. 3.
    Siebenhaller, M., Kaufmann, M.: Drawing activity diagrams. In: Proceedings of ACM 2006 Symposium on Software Visualization, SoftVis 2006, pp. 159–160. ACM, New York (2006)CrossRefGoogle Scholar
  4. 4.
    Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man, and Cybernetics SMC-11(2), 109–125 (1981)CrossRefMathSciNetGoogle Scholar
  5. 5.
    Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM Journal on Computing 16(3), 421–444 (1987)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Philip Effinger
    • 1
  • Gero Decker
    • 2
  1. 1.Wilhelm-Schickard-InstitutEberhard-Karls-Universität TübingenGermany
  2. 2.Hasso-Plattner-InstitutUniversität PotsdamGermany

Personalised recommendations