A linear time layout algorithm for business process models

The layout of a business process model influences how easily it can be understood. Existing layout features in process modeling tools often rely on graph representations, 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 toward establishing a readable layout of a process model. Our algorithm exploits the structure of the process model and allows the computation of the final layout in linear time. We explain the algorithm, show its detailed run-time complexity, compare it to existing algorithms, and demonstrate in an empirical evaluation the acceptance of the layout generated by the algorithm. The data suggests that the proposed algorithm is well perceived by moderately experienced process modelers, both in terms of its usefulness as well as its ease of use.

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

[2]  Jan Mendling,et al.  What Makes Process Models Understandable? , 2007, BPM.

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

[4]  Venkataraman Ramesh,et al.  Understanding Conceptual Schemas: Exploring the Role of Application and IS Domain Knowledge , 2006, Inf. Syst. Res..

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

[6]  Fred D. Davis.  Perceived Usefulness, Perceived Ease of Use, and User Acceptance of Information Technology , 1989, MIS Q..

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

[8]  August-Wilhelm Scheer,et al.  ARIS - Business Process Modeling , 1998 .

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

[10]  Bill Curtis,et al.  Process modeling , 1992, CACM.

[11]  Hajo A. Reijers,et al.  Edges, Structure, and Constraints: The Layout of Business Process Models , 2011 .

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

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

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

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

[16]  Ivo Vondrák,et al.  Business Process Modeling , 2007, Encyclopedia of Database Systems.

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

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

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

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

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

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

[23]  PetreMarian.  Why looking isn't always seeing , 1995 .

[24]  Anna Lubiw,et al.  Upward Planar Drawing of Single Source Acyclic Digraphs , 1991, Planar Graphs.

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

[26]  Wil M. P. van der Aalst,et al.  Advanced Workflow Patterns , 2000, CoopIS.

[27]  Carlo Mannino,et al.  Optimal Upward Planarity Testing of Single-Source Digraphs , 1993, ESA.

[28]  Jan Mendling,et al.  Managing Process Model Complexity via Concrete Syntax Modifications , 2011, IEEE Transactions on Industrial Informatics.

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

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

[31]  George M. Giaglis,et al.  A Taxonomy of Business Process Modeling and Information Systems Modeling Techniques , 2001 .

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

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

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

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