Abstract: 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.
Publication Year: 2009
Publication Date: 2009-09-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 108
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot