Efficiently computing alignments: algorithm and datastructures

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

4 Citations (Scopus)
6 Downloads (Pure)


Conformance checking is considered to be anything where observed behaviour needs to be related to already modelled behaviour. Fundamental to conformance checking are alignments which provide a precise relation between a sequence of activities observed in an event log and a execution sequence of a model. However, computing alignments is a complex task, both in time and memory, especially when models contain large amounts of parallelism. In this tool paper we present the actual algorithm and memory structures used for the experiments of [15]. We discuss the time complexity of the algorithm, as well as the space and time complexity of the main data structures. We further present the integration in ProM and a basic code snippet in Java for computing alignments from within any tool.

Original languageEnglish
Title of host publicationBusiness Process Management Workshops - BPM 2018 International Workshops, Revised Papers
EditorsFlorian Daniel, Quan Z. Sheng, Hamid Motahari
Number of pages12
ISBN (Print)9783030116408
Publication statusPublished - 29 Jan 2019
Event16th International Conference on Business Process Management (BPM 2018) - Sydney, Australia
Duration: 9 Sept 201814 Sept 2018
Conference number: 16

Publication series

NameLecture Notes in Business Information Processing
ISSN (Print)1865-1348


Conference16th International Conference on Business Process Management (BPM 2018)
Abbreviated titleBPM 2018
OtherDissertation Award, Demonstration, and Industrial Track at BPM
Internet address


  • Alignments
  • Conformance checking
  • Process mining


Dive into the research topics of 'Efficiently computing alignments: algorithm and datastructures'. Together they form a unique fingerprint.

Cite this