A Novel Hierarchical Method for Decomposition and Design of Workflow Models

Modeling and analysis of large and complex workflow processes includes transformation of the process logic into a formal representation. Petri net-based modeling is convenient, but it suffers from the complexity due to states explosion problems, which make the technique less practical. In this paper, we develop simple and powerful Petri net transformations rules that can reduce or expand the Petri net model of workflow. Then we show that the modified net can be obtained without changing the correct behavior of the original net. A sequence of transformation results in a hierarchy of reduced nets that allow easy verification and hierarchical decomposition of the system. Moreover, we show that our result can be used as a design tool for the correct construction of an arbitrary class of sound workflow structures. An efficient algorithm is provided to tackle this new approach comprehensively.

[1]  Gérard Berthelot,et al.  Transformations and Decompositions of Nets , 1986, Advances in Petri Nets.

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

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

[4]  F. Harary,et al.  The theory of graphs and its applications , 1963 .

[5]  Loucif Zerguini Improving the Efficiency of Workflow Analysis , 2003, CAiSE Short Paper Proceedings.

[6]  Jochen Schwarze An algorithm for hierarchical reduction and decomposition of a directed graph , 2005, Computing.

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

[8]  L. Zerguini,et al.  Analysis of large workflow models , 2002, IEEE International Conference on Systems, Man and Cybernetics.

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

[10]  Claude Berge,et al.  The theory of graphs and its applications , 1962 .