Stepwise structural verification of cyclic workflow models with acyclic decomposition and reduction of loops

Abstract Existence of cycles (or loops) is one of the main sources that make the analysis of workflow models difficult. Several approaches of structural verification exist in the literature, but how to verify cyclic workflow models efficiently in a comprehensible form remains an open research question. Thus, a novel structural verification approach for cyclic workflow models by means of acyclic decomposition and reduction of loops is introduced in this paper with the following contributions. First, acyclic decomposition of natural loops, further enhanced by reduction of nested loops, enables existing verification techniques, normally dealing with acyclic models, to handle workflow models with natural loops. Second, instantiation of an irreducible loop into natural loops, altogether with reduction of concurrent loop entries, enables the proposed approach to handle workflow models with irreducible loops. Last, diagnostic information, provided by the proposed approach, helps stakeholders correct and improve their workflow models. Two examples are provided to show that the proposed approach is systematic and practical. In addition, a prototype of the proposed approach is developed. Its execution result shows that, while providing diagnostic information, the proposed approach can handle workflow models with arbitrary cycles effectively.

[1]  Moe Thandar Wynn,et al.  Business process verification - finally a reality! , 2009, Bus. Process. Manag. J..

[2]  G. Ramalingam,et al.  On loops, dominators, and dominance frontiers , 2002, TOPL.

[3]  Wil M.P. van der Aalst,et al.  Three good reasons for using a Petri-net-based workflow management system , 1996 .

[4]  Roman Barták,et al.  On verification of nested workflows with extra constraints: From theory to practice , 2014, Expert Syst. Appl..

[5]  Ekkart Kindler,et al.  On the semantics of EPCs: Resolving the vicious circle , 2006, Data Knowl. Eng..

[6]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[7]  Robert W. Blanning,et al.  A Formal Approach to Workflow Analysis , 2000, Inf. Syst. Res..

[8]  Ken Kennedy,et al.  AS imple, Fast Dominance Algorithm , 1999 .

[9]  Wil M. P. van der Aalst,et al.  The Application of Petri Nets to Workflow Management , 1998, J. Circuits Syst. Comput..

[10]  Jan Mendling,et al.  A quantitative analysis of faulty EPCs in the SAP reference model , 2006 .

[11]  Mathias Weske,et al.  Business Process Management: A Survey , 2003, Business Process Management.

[12]  Nicolás Ricci,et al.  Fluent Logic Workflow Analyser: A Tool for The Verification of Workflow Properties , 2014, LAFM.

[13]  Rik Eshuis,et al.  An integer programming based approach for verification and diagnosis of workflows , 2010, Data Knowl. Eng..

[14]  Juliane Dehnert,et al.  Relaxed Soundness of Business Processes , 2001, CAiSE.

[15]  Yannis Smaragdakis,et al.  J-Orchestra: Enhancing Java programs with distribution capabilities , 2009, TSEM.

[16]  Fei Cao,et al.  Compiling business processes: untangling unstructured loops in irreducible flow graphs , 2006, Int. J. Web Grid Serv..

[17]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[18]  Jan Mendling,et al.  Detection and prediction of errors in EPCs of the SAP reference model , 2008, Data Knowl. Eng..

[19]  J. Leon Zhao,et al.  Decomposition-Based Verification of Cyclic Workflows , 2005, ATVA.

[20]  Yuzhen Dong Management logic verification of a workflow model , 2013, 2013 6th International Conference on Information Management, Innovation Management and Industrial Engineering.

[21]  Moe Thandar Wynn,et al.  Reduction rules for reset workflow nets , 2006 .

[22]  Antti Valmari,et al.  The State Explosion Problem , 1996, Petri Nets.

[23]  Akhil Kumar,et al.  Research Commentary: Workflow Management Issues in e-Business , 2002, Inf. Syst. Res..

[24]  Antti Valmari,et al.  Stubborn sets for reduced state space generation , 1991, Applications and Theory of Petri Nets.

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

[26]  Yu Chen,et al.  A New Algorithm for Identifying Loops in Decompilation , 2007, SAS.

[27]  Henry H. Bi,et al.  Applying Propositional Logic to Workflow Verification , 2004, Inf. Technol. Manag..

[28]  Remco M. Dijkman,et al.  Semantics and analysis of business process models in BPMN , 2008, Inf. Softw. Technol..

[29]  Jan Mendling,et al.  From business process models to process-oriented software systems , 2009, TSEM.

[30]  Anas N. Al-Rabadi,et al.  A comparison of modified reconstructability analysis and Ashenhurst‐Curtis decomposition of Boolean functions , 2004 .

[31]  Fabio Casati,et al.  Business process management: Where business processes and web services meet , 2007, Data Knowl. Eng..

[32]  Jorge S. Cardoso,et al.  Approaches to Compute Workflow Complexity , 2006, The Role of Business Processes in Service Oriented Architectures.

[33]  Shane Sendall,et al.  Declarative techniques for model-driven business process integration , 2005, IBM Syst. J..

[34]  Paul Havlak,et al.  Nesting of reducible and irreducible loops , 1997, TOPL.

[35]  Volker Gruhn,et al.  What business process modelers can learn from programmers , 2007, Sci. Comput. Program..

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

[37]  Anna Kalenkova,et al.  Application of if-conversion to verification and optimization of workflows , 2010, Programming and Computer Software.

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

[39]  Ashutosh Tiwari,et al.  Business Process Analysis and Optimization: Beyond Reengineering , 2008, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[40]  Jan Mendling,et al.  Structuredness and its significance for correctness of process models , 2010, Inf. Syst. E Bus. Manag..

[41]  Henk Corporaal,et al.  Making graphs reducible with controlled node splitting , 1997, TOPL.

[42]  Hao Wang,et al.  A Model Slicing Method for Workflow Verification , 2013, Electron. Notes Theor. Comput. Sci..

[43]  Maria E. Orlowska,et al.  Verification Problems in Conceptual Workflow Specifications , 1996, Data Knowl. Eng..

[44]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

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

[46]  Karsten Wolf,et al.  Generating Petri Net State Spaces , 2007, ICATPN.

[47]  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).

[48]  MengChu Zhou,et al.  Performance modeling and analysis of workflow , 2004, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[49]  Guang R. Gao,et al.  Identifying loops using DJ graphs , 1996, TOPL.

[50]  Dirk Fahland,et al.  Analysis on demand: Instantaneous soundness checking of industrial business process models , 2011, Data Knowl. Eng..

[51]  Edward A. Lee,et al.  Scientific workflow management and the Kepler system , 2006, Concurr. Comput. Pract. Exp..

[52]  Moe Thandar Wynn,et al.  Soundness of workflow nets: classification, decidability, and analysis , 2011, Formal Aspects of Computing.

[53]  C. A. Lang Programming languages for writing system programs , 1974 .

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

[55]  Akhil Kumar,et al.  An Analysis and Taxonomy of Unstructured Workflows , 2005, Business Process Management.

[56]  Mordechai Ben-Ari,et al.  A primer on model checking , 2010, INROADS.

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

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