Faster and More Focused Control-Flow Analysis for Business Process Models Through SESE Decomposition

We present a technique to enhance control-flow analysis of business process models. The technique considerably speeds up the analysis and improves the diagnostic information that is given to the user to fix control-flow errors. The technique consists of two parts: Firstly, the process model is decomposed into single-entry-single-exit (SESE) fragments, which are usually substantially smaller than the original process. This decomposition is done in linear time. Secondly, each fragment is analyzed in isolation using a fast heuristic that can analyze many of the fragments occurring in practice. Any remaining fragments that are not covered by the heuristic can then be analyzed using any known complete analysis technique. We used our technique in a case study with more than 340 real business processes modeled with the IBM WebSphere Business Modeler. The results suggest that control-flow analysis of many real process models is feasible without significant delay (less than a second). Therefore, control-flow analysis could be used frequently during editing time, which allows errors to be caught at earliest possible time.

[1]  C. Scott Ananian,et al.  The static single information form , 2001 .

[2]  Jörg Desel,et al.  Free choice Petri nets , 1995 .

[3]  Jussi Vanhatalo,et al.  An Incremental Approach to the Analysis and Transformation of Workflows Using Region Trees , 2008, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[4]  Robert Valette,et al.  Analysis of Petri Nets by Stepwise Refinements , 1979, J. Comput. Syst. Sci..

[5]  Peter Kemper,et al.  Linear Time Algorithm to Find a Minimal Deadlock in a Strongly Connected Free-Choice Net , 1993, Application and Theory of Petri Nets.

[6]  Loucif Zerguini,et al.  A Novel Hierarchical Method for Decomposition and Design of Workflow Models , 2004, Trans. SDPS.

[7]  Wil M. P. van der Aalst,et al.  Workflow Verification: Finding Control-Flow Errors Using Petri-Net-Based Techniques , 2000, Business Process Management.

[8]  Hao Lin,et al.  A novel graph reduction algorithm to identify structural conflicts , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[9]  Jan Mendling,et al.  Faulty EPCs in the SAP Reference Model , 2006, Business Process Management.

[10]  Ambuj Mahanti,et al.  A graph-search based algorithm for verifying workflow graphs , 2005, 16th International Workshop on Database and Expert Systems Applications (DEXA'05).

[11]  Boudewijn F. van Dongen,et al.  Verification of EPCs: Using Reduction Rules and Petri Nets , 2005, CAiSE.

[12]  Wil M. P. van der Aalst,et al.  Diagnosing Workflow Processes using Woflan , 2001, Comput. J..

[13]  Javier Esparza Reduction and Synthesis of Live and Bounded Free Choice Petri Nets , 1994, Inf. Comput..

[14]  Jan Mendling,et al.  Detection and prediction of errors in EPC business process models , 2007 .

[15]  Marco Ajmone Marsan,et al.  Application and Theory of Petri Nets 1993 , 1993, Lecture Notes in Computer Science.

[16]  Keshav Pingali,et al.  The program structure tree: computing control regions in linear time , 1994, PLDI '94.

[17]  Wil M. P. van der Aalst,et al.  An Alternative Way to Analyze Workflow Graphs , 2002, CAiSE.

[18]  Maria E. Orlowska,et al.  Analyzing Process Models Using Graph Reduction Techniques , 2000, Inf. Syst..