Aligning Business Process Models

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. Keywords-business process model; model comparison; model merging;

• Type: Conference
• Year: 2009
• Where: EDOC
• Authors: Remco M. Dijkman, Marlon Dumas, Luciano García-Bañuelos, Reina Käärik
• Keywords: Business Process Models, Distributed And Parallel Computing, EDOC 2009, Graph Matching, Lexical Matching