On a relation between graph edit distance and maximum common subgraph
Pattern Recognition Letters
A survey of approaches to automatic schema matching
The VLDB Journal — The International Journal on Very Large Data Bases
Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
A case-based reasoning framework for workflow model management
Data & Knowledge Engineering - Special issue: Advances in business process management
Matching and Merging of Statecharts Specifications
ICSE '07 Proceedings of the 29th international conference on Software Engineering
Measuring similarity between semantic business process models
APCCM '07 Proceedings of the fourth Asia-Pacific conference on Comceptual modelling - Volume 67
A Classification of Differences between Similar BusinessProcesses
EDOC '07 Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference
Business Process Management: Concepts, Languages, Architectures
Business Process Management: Concepts, Languages, Architectures
Data & Knowledge Engineering
On the discovery of preferred work practice through business process variants
ER'07 Proceedings of the 26th international conference on Conceptual modeling
BPEL processes matchmaking for service discovery
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I
Evaluation of technical measures for workflow similarity based on a pilot study
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I
Merging business process models
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems - Volume Part I
Identifying refactoring opportunities in process model repositories
Information and Software Technology
Design by selection: a reuse-based approach for business process modeling
ER'11 Proceedings of the 30th international conference on Conceptual modeling
Efficient computation of causal behavioural profiles using structural decomposition
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
| Hi-index | 0.00 |
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.