A workflow net similarity measure based on transition adjacency relations

被引:114
作者
Zha, Haiping [2 ,4 ,5 ]
Wang, Jianmin [1 ,3 ]
Wen, Lijie [3 ]
Wang, Chaokun [3 ]
Sun, Jiaguang [3 ]
机构
[1] Tsinghua Univ, Inst Informat Syst & Engn, Sch Software, Beijing 100084, Peoples R China
[2] Tsinghua Univ, Dept Comp Sci, Beijing 100084, Peoples R China
[3] Tsinghua Natl Lab Informat Sci & Technol, Beijing, Peoples R China
[4] Inst Specificat & Stand, Shanghai 200235, Peoples R China
[5] Tsinghua Univ, Dept Comp Sci & Technol, Beijing 100084, Peoples R China
基金
中国国家自然科学基金;
关键词
Process similarity; Process distance; Transition adjacency relation; Workflow net; Model reduction; PROCESS MODELS; PROCESS EQUIVALENCE; OBSERVED BEHAVIOR; PETRI NETS; REDUCTION; DISTANCE;
D O I
10.1016/j.compind.2010.01.001
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Many activities in business process management, such as process retrieval, process mining, and process integration, need to determine the similarity or the distance between two processes. Although several approaches have recently been proposed to measure the similarity between business processes, neither the definitions of the similarity notion between processes nor the measure methods have gained wide recognition. In this paper, we define the similarity and the distance based on firing sequences in the context of workflow nets (WF-nets) as the unified reference concepts. However, to many WF-nets, either the number of full firing sequences or the length of a single firing sequence is infinite. Since transition adjacency relations (TARs) can be seen as the genes of the firing sequences which describe transition orders appearing in all possible firing sequences, we propose a practical similarity definition based on the TAR sets of two processes. It is formally shown that the corresponding distance measure between processes is a metric. An algorithm using model reduction techniques for the efficient computation of the measure is also presented. Experimental results involving comparison of different measures on artificial processes and evaluations on clustering real-life processes validate our approach. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码:463 / 471
页数:9
相关论文
共 26 条
[1]  
[Anonymous], 1980, CALCULUS COMMUNICATI, DOI DOI 10.1007/3-540-10235-3
[2]  
Berthelot G, 1986, LECTURE NOTES COMPUT, V254, P359
[3]   A graph distance metric based on the maximal common subgraph [J].
Bunke, H ;
Shearer, K .
PATTERN RECOGNITION LETTERS, 1998, 19 (3-4) :255-259
[4]   Searching in metric spaces [J].
Chávez, E ;
Navarro, G ;
BaezaYates, R ;
Marroquín, JL .
ACM COMPUTING SURVEYS, 2001, 33 (03) :273-321
[5]   Quantifying process equivalence based on observed behavior [J].
de Medeiros, A. K. Alves ;
van der Aalst, W. M. P. ;
Weijters, A. J. M. M. .
DATA & KNOWLEDGE ENGINEERING, 2008, 64 (01) :55-74
[6]  
Dumas M, 2005, PROCESS-AWARE INFORMATION SYSTEMS: BRIDGING PEOPLE AND SOFTWARE THROUGH PROCESS TECHNOLOGY, P1, DOI 10.1002/0471741442
[7]  
EHRIG M, 2007, P 4 AS PAC C CONC MO, V67, P71
[8]  
Esparza J., 1998, LECT PETRI NETS, V1491, P374
[9]  
Kaizhong Zhang, 1996, International Journal of Foundations of Computer Science, V7, P43, DOI 10.1142/S0129054196000051
[10]  
Kaufman L., 2009, Finding Groups in Data: An Introduction to Cluster Analysis