A practical method to analyze workflow logic models

The analysis of workflow is crucial to the correctness of workflow applications. This paper introduces a simple and practical method for analyzing workflow logic models. Firstly, some definitions of the models and some properties, such as throughness, no‐redundant‐transition and boundedness, are presented. Then, we propose an approach based on synchronized reachability graphs (SRGs) to verify these properties. The SRG uses the characteristics of synchronizers in workflow logic models and mitigates the state explosion by constructing synchronized occurrence sequences rather than interleaving occurrence sequences. This paper also proposes some refined and feasible reduction rules which can preserve vital properties of workflow logic models. Using these two techniques, the SRG‐based verification method can achieve higher efficiency. Furthermore, this research also develops a verification tool based on the method, presents the analysis results of some practical cases and compares our method with others. Copyright © 2007 John Wiley & Sons, Ltd.

[1]  Patrice Godefroid,et al.  Partial-Order Methods for the Verification of Concurrent Systems , 1996, Lecture Notes in Computer Science.

[2]  Jörg Desel,et al.  Free Choice Petri Nets (Cambridge Tracts in Theoretical Computer Science) , 2005 .

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

[4]  Jian-Tao Zhou.  A Method for Semantic Verification of Workflow Processes Based on Petri Net Reduction Technique , 2005 .

[5]  Javier Esparza,et al.  Implementing LTL model checking with net unfoldings , 2001, SPIN '01.

[6]  Ekkart Kindler,et al.  The Petri Net Markup Language , 2003, Petri Net Technology for Communication-Based Systems.

[7]  Maria E. Orlowska,et al.  Applying Graph Reduction Techniques for Identifying Structural Conflicts in Process Models , 1999, CAiSE.

[8]  Shikun Zhang,et al.  A Workflow Process Mining Algorithm Based on Synchro-Net , 2006, Journal of Computer Science and Technology.

[9]  Falko Bause,et al.  Analysis of Petri Nets with a Dynamic Priority Method , 1997, ICATPN.

[10]  Antti Valmari,et al.  A stubborn attack on state explosion , 1990, Formal Methods Syst. Des..

[11]  Li Jian.  RESEARCH OF PETRI NET BASED WORKFLOW MODEL REDUCTION METHODS , 2001 .

[12]  Kees M. van Hee,et al.  Workflow Management: Models, Methods, and Systems , 2002, Cooperative information systems.

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

[14]  Kimmo Varpaaniemi,et al.  Stable Models for Stubborn Sets , 2000, Fundam. Informaticae.

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

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

[17]  Rüdiger Valk,et al.  Petri nets for systems engineering - a guide to modeling, verification, and applications , 2010 .

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

[19]  Kenneth L. McMillan,et al.  Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits , 1992, CAV.