CFP-based method to extract execution instance representation graphs from business processes

Liang SONG; Lijie WEN; Jianmin WANG; Guoping LIU; Tinglong LIU; Jianyong YANG

PDF(955 KB)

Journal of Tsinghua University(Science and Technology) ›› 2014, Vol. 54 ›› Issue (4) : 490-494.

Orginal Article

CFP-based method to extract execution instance representation graphs from business processes

Author information +

History +

Abstract

Studies of the semantic behavioral properties of business processes are limited by state explosion caused by interleaving of concurrent events. The complete finite prefix (CFP) method avoids the state explosion problem as much as possible and gives full reachability information for process models. However, CFP may lose temporal-order information between tasks. This paper describes a CFP based method that extracts all execution instances from business process models. Thus, this method overcomes the shortcomings of the CFP method. The method uses back traversing from the co-sets of leaf nodes to the initial nodes to extract the execution instances in process models that are then represented by an execution instance representation graph. Tests with a process model repository show that this method is very efficient and accurate.

Key words

process model / behavioral property / execution instance / complete finite prefix

Cite this article

EndNote

Ris (Procite)

Bibtex

Download Citations

Liang SONG,Lijie WEN,Jianmin WANG,Guoping LIU,Tinglong LIU,Jianyong YANG. CFP-based method to extract execution instance representation graphs from business processes[J]. Journal of Tsinghua University(Science and Technology). 2014, 54(4): 490-494

References

[1]	Awad A. BPMN-Q: A language to query business processes [C]// Proceedings of the 2nd International Workshop on Enterprise Modelling and Information Systems Architectures (EMISA'07). Bonn, Germany: Greenhill, 2007: 115-128.
[2]	Beeri C, Eyal A, Kamenkovich S, et al.Querying business processes with BP-QL [J]. Information Systems, 2008, 33(6): 477-507.
[3]	Awad A, Decker G, Weske M. Efficient compliance checking using bpmn-q and temporal logic [C]// Proceedings of the 6th International Conference on Business Process Management. Berlin, Germany: Springer-Verlag, 2008: 326-341.
[4]	Weidlich M, Mendling J, Weske M. Efficient consistency measurement based on behavioral profiles of process models[J]. IEEE Transactions on Software Engineering, 2011, 37(3), 410-429.
[5]	Becker M, Laue R. A comparative survey of business process similarity measures[J]. Computers in Industry, 2012, 63(2): 148-167.
[6]	Mcmillan K L. Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits [C]// Proceedings of the Fourth International Workshop on Computer Aided Verification. London, UK: Springer-Verlag, 1992: 164-177.
[7]	Mcmillan K L. Atechnique of a state space search based on unfolding[J]. Formal Methods in System Design, 1995, 6(1): 45-65.
[8]	Murata T. Petri nets: Properties, analysis and applications[J]. Proceedings of the IEEE, 1989, 77(4): 541-580.
[9]	Aalst W M P van der. The application of Petri nets to workflow management[J].The Journal of Circuits, Systems and Computers, 1998, 8(1): 21-66.
[10]	Nielsen M, Plotkin G D, Winskel G. Petri nets, event structures and domains [C]// Proceedings of the International Symposium on Semantics of Concurrent Computation. London, UK: Springer-Verlag, 1979: 266-284.
[11]	Engelfriet J. Branching processes of petri nets[J]. Acta Informatica, 1991, 28(6): 575-591.
[12]	Clarke E M, Grumberg O, Peled D. Model Checking [M]. Massachusetts, USA: MIT Press, 1999.
[13]	Esparza J, Römer S, Vogler W. An improvement of mcmillan's unfolding algorithm[J]. Formal Methods in System Design, 2002, 20(3): 285-310.