Edges, Structure, and Constraints: The Layout of Business Process Models

How a business process model is laid out will affect the ease of making sense of it. Existing layout features in process modeling tools often rely on generic insights on graph representation, but do not take the specific properties of business process models into account. In this paper, we propose an algorithm that is based on a set of constraints which are specifically identified towards establishing a readable layout of a process model. By exploiting the structure of the process model, the proposed algorithm allows for the computation of the final layout in linear time. An empirical evaluation shows that the proposed algorithm indeed provides support beyond what moderately experienced process modelers undertake to lay out their process models.

[1]  Helen C. Purchase,et al.  Which Aesthetic has the Greatest Effect on Human Understanding? , 1997, GD.

[2]  Roberto Tamassia,et al.  Algorithms for Plane Representations of Acyclic Digraphs , 1988, Theor. Comput. Sci..

[3]  Wil M. P. van der Aalst,et al.  Workflow Patterns , 2004, Distributed and Parallel Databases.

[4]  Frank Harary,et al.  Graph Theory , 2016 .

[5]  A. B. Kahn,et al.  Topological sorting of large networks , 1962, CACM.

[6]  Jan Mendling,et al.  A Study Into the Factors That Influence the Understandability of Business Process Models , 2011, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[7]  Jana Koehler,et al.  The refined process structure tree , 2009, Data Knowl. Eng..

[8]  Benno Stein,et al.  On the Generalized Box-Drawing of Trees — Survey and New Technology — , 2007 .

[9]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[10]  Barbara Weber,et al.  Investigating the Process of Process Modeling with Cheetah Experimental Platform , 2010, ER-POIS@CAiSE.

[11]  Hajo A. Reijers,et al.  Social software for business process modeling , 2010, J. Inf. Technol..

[12]  Marian Petre,et al.  Why looking isn't always seeing: readership skills and graphical programming , 1995, CACM.

[13]  Carlo Mannino,et al.  Optimal Upward Planarity Testing of Single-Source Digraphs , 1998, SIAM J. Comput..

[14]  Jan Mendling,et al.  The Impact of Secondary Notation on Process Model Understanding , 2009, PoEM.

[15]  Frank Leymann,et al.  Faster and More Focused Control-Flow Analysis for Business Process Models Through SESE Decomposition , 2007, ICSOC.

[16]  Leif Singer,et al.  A Simple Algorithm for Automatic Layout of BPMN Processes , 2009, 2009 IEEE Conference on Commerce and Enterprise Computing.

[17]  Jan Recker,et al.  How Novices Model Business Processes , 2010, BPM.

[18]  David S. Johnson,et al.  Crossing Number is NP-Complete , 1983 .

[19]  Emden R. Gansner,et al.  A Technique for Drawing Directed Graphs , 1993, IEEE Trans. Software Eng..

[20]  Jana Koehler,et al.  The refined process structure tree , 2008, Data Knowl. Eng..

[21]  Wil M. P. van der Aalst,et al.  Bridging The Gap Between Business Models And Workflow Specifications , 2004, Int. J. Cooperative Inf. Syst..

[22]  MICHAEL D. HUTTON,et al.  Upward planar drawing of single source acyclic digraphs , 1991, SODA '91.

[23]  John N. Warfield,et al.  Crossing Theory and Hierarchy Mapping , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

[24]  David A. Carrington,et al.  Empirical Evaluation of Aesthetics-based Graph Layout , 2002, Empirical Software Engineering.

[25]  Georg Sander,et al.  Graph Layout for Workflow Applications with ILOG JViews , 2002, Graph Drawing.

[26]  Md. Saidur Rahman,et al.  A linear algorithm for compact box‐drawings of trees , 2003, Networks.