Aligning Business Process Models

被引:60
作者
Dijkman, Remco [1 ]
Dumas, Marlon [2 ]
Garcia-Banuelos, Luciano [3 ]
Kaarik, Reina [2 ]
机构
[1] Eindhoven Univ Technol, NL-5600 MB Eindhoven, Netherlands
[2] Univ Tartu, Tartu, Estonia
[3] Univ Autonoma Tlaxcala, Mexico City, DF, Mexico
来源
EDOC: 2009 IEEE INTERNATIONAL ENTERPRISE DISTRIBUTED OBJECT COMPUTING CONFERENCE | 2009年
关键词
business process model; model comparison; model merging; SIMILARITY; ALGORITHM;
D O I
10.1109/EDOC.2009.11
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper studies the following problem: given a pair of business process models, determine which elements in one model are related to which elements in the other model. This problem arises in the context of merging different versions or variants of a business process model or when comparing business process models in order to display their similarities and differences. The paper investigates two approaches to this alignment problem: one based purely on lexical matching of pairs of elements and another based on error-correcting graph matching. Using a set of models taken from real-life scenarios, the paper empirically shows that graph matching techniques yield a significantly higher precision than pure lexical matching, while achieving comparable recall.
引用
收藏
页码:45 / +
页数:3
相关论文
共 24 条
[1]  
[Anonymous], 1995, THESIS U BERN SWITZE
[2]  
[Anonymous], 2019, Business Process Management: Concepts, Languages, Architectures
[3]  
Brockmans S, 2006, ICEIS 2006: PROCEEDINGS OF THE EIGHTH INTERNATIONAL CONFERENCE ON ENTERPRISE INFORMATION SYSTEMS, P191
[4]   On a relation between graph edit distance and maximum common subgraph [J].
Bunke, H .
PATTERN RECOGNITION LETTERS, 1997, 18 (08) :689-694
[5]  
Corrales JC, 2006, LECT NOTES COMPUT SC, V4275, P237
[6]  
Dijkman R, 2008, LECT NOTES COMPUT SC, V5240, P261, DOI 10.1007/978-3-540-85758-7_20
[7]   A classification of differences between similar business processes [J].
Dijkman, Remco .
11TH IEEE INTERNATIONAL ENTERPRISE DISTRIBUTED OBJECT COMPUTING CONFERENCE, PROCEEDINGS, 2007, :37-47
[8]  
DIJKMAN RM, 2009, 269 BETA RES SCH
[9]  
EHRIG M, 2007, CRPIT, V67, P71
[10]  
KUSTER J, 2008, 6 INT C BUS PROC MAN, P244