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.

[1]  Remco M. Dijkman.  A Classification of Differences between Similar BusinessProcesses , 2007, 11th IEEE International Enterprise Distributed Object Computing Conference (EDOC 2007).

[2]  Mathias Weske,et al.  Business Process Management: Concepts, Languages, Architectures , 2007 .

[3]  Horst Bunke,et al.  An Error-Tolerant Approximate Matching Algorithm for Attributed Planar Graphs and Its Application to Fingerprint Classification , 2004, SSPR/SPR.

[4]  Manfred Reichert,et al.  On Measuring Process Model Similarity Based on High-Level Change Operations , 2007, ER.

[5]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .

[6]  Andreas Wombacher.  Evaluation of Technical Measures for Workflow Similarity Based on a Pilot Study , 2006, OTM Conferences.

[7]  J. Leon Zhao,et al.  A case-based reasoning framework for workflow model management , 2004, Data Knowl. Eng..

[8]  Remco M. Dijkman,et al.  Measuring Similarity between Business Process Models , 2008, CAiSE.

[9]  Wineke A. M. van Lent,et al.  Similarity of business process models : metrics and evaluation , 2009 .

[10]  Horst Bunke,et al.  On a relation between graph edit distance and maximum common subgraph , 1997, Pattern Recognit. Lett..

[11]  Shazia Wasim Sadiq,et al.  On the Discovery of Preferred Work Practice Through Business Process Variants , 2007, ER.

[12]  Ralph Bergmann,et al.  Representation and Structure-Based Similarity Assessment for Agile Workflows , 2007, LWA.

[13]  Mehrdad Sabetzadeh,et al.  Matching and Merging of Statecharts Specifications , 2007, 29th International Conference on Software Engineering (ICSE'07).

[14]  Erhard Rahm,et al.  Similarity flooding: a versatile graph matching algorithm and its application to schema matching , 2002, Proceedings 18th International Conference on Data Engineering.

[15]  Daniela Grigori,et al.  BPEL Processes Matchmaking for Service Discovery , 2006, OTM Conferences.

[16]  Erhard Rahm,et al.  A survey of approaches to automatic schema matching , 2001, The VLDB Journal.

[17]  Marc Ehrig,et al.  Semantic Alignment of Business Processes , 2006, ICEIS.

[18]  Remco M. Dijkman.  Diagnosing Differences between Business Process Models , 2008, BPM.

[19]  Gregor Engels,et al.  Detecting and Resolving Process Model Differences in the Absence of a Change Log , 2008, BPM.

[20]  Stefanie Rinderle-Ma,et al.  Change patterns and change support features - Enhancing flexibility in process-aware information systems , 2008, Data Knowl. Eng..

[21]  Martin F. Porter,et al.  An algorithm for suffix stripping , 1997, Program.

[22]  Marc Ehrig,et al.  Measuring Similarity between Semantic Business Process Models , 2007, APCCM.