Merging alignments for decomposed replay

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

17 Citations (Scopus)


In the area of process mining, conformance checking aims to find an optimal alignment between an event log (which captures the activities that actually have happened) and a Petri net (which describes expected or normative behavior). Optimal alignments highlight discrepancies between observed and modeled behavior. To find an optimal alignment, a potentially challenging optimization problem needs to be solved based on a predefined cost function for misalignments. Unfortunately, this may be very time consuming for larger logs and models and often intractable. A solution is to decompose the problem of finding an optimal alignment in many smaller problems that are easier to solve. Decomposition can be used to detect conformance problems in less time and provides a lower bound for the costs of an optimal alignment. Although the existing approach is able to decide whether a trace fits or not, it does not provide an overall alignment. In this paper, we provide an algorithm that is able provide such an optimal alignment from the decomposed alignments if this is possible. Otherwise, the algorithm produces a so-called pseudo-alignment that can still be used to pinpoint non-conforming parts of log and model. The approach has been implemented in ProM and tested on various real-life event logs.
Original languageEnglish
Title of host publicationApplication and Theory of Petri Nets and Concurrency
Subtitle of host publication37th International Conference, PETRI NETS 2016, Toruń, Poland, June 19-24, 2016. Proceedings
EditorsF. Kordon, D. Moldt
Place of PublicationDordrecht
Number of pages21
ISBN (Electronic)978-3-319-39086-4
ISBN (Print)978-3-319-39085-7
Publication statusPublished - Jun 2016

Publication series



Dive into the research topics of 'Merging alignments for decomposed replay'. Together they form a unique fingerprint.

Cite this