Aligning business process models

R.M. Dijkman, M. Dumas, L. García-Bañuelos, R. Käärik

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

89 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationProceedings of the 13th IEEE International Enterprise Distributed Object Computing Conference EDOC conference, Auckland
Place of PublicationPiscataway, NJ
PublisherIEEE Computer Society
Pages45-53
ISBN (Print)978-0-7695-3785-6
DOIs
Publication statusPublished - 2009
Event13th IEEE International Enterprise Distributed Object Computing Conference (EDOC 2009) - Auckland, New Zealand
Duration: 1 Sep 20094 Sep 2009
Conference number: 13

Conference

Conference13th IEEE International Enterprise Distributed Object Computing Conference (EDOC 2009)
Abbreviated titleEDOC 2009
CountryNew Zealand
CityAuckland
Period1/09/094/09/09

Fingerprint Dive into the research topics of 'Aligning business process models'. Together they form a unique fingerprint.

Cite this