Efficiently computing alignments: algorithm and datastructures

van Dongen, B. F. (2019). Efficiently computing alignments: algorithm and datastructures. In F. Daniel, Q. Z. Sheng, & H. Motahari (Eds.), Business Process Management Workshops – BPM 2018 International Workshops, Revised Papers (pp. 44-55). (Lecture Notes in Business Information Processing; Vol. 342). Springer. DOI: 10.1007/978-3-030-11641-5_4


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.

Leave a Reply