Efficiently computing alignments: algorithm and datastructures

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

    3 Citations (Scopus)
    4 Downloads (Pure)

    Abstract

    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
    PublisherSpringer
    Pages44-55
    Number of pages12
    ISBN (Print)9783030116408
    DOIs
    Publication statusPublished - 29 Jan 2019
    Event16th International Conference on Business Process Management, BPM 2018 - Sydney, Australia
    Duration: 9 Sep 201814 Sep 2018

    Publication series

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

    Conference

    Conference16th International Conference on Business Process Management, BPM 2018
    CountryAustralia
    CitySydney
    Period9/09/1814/09/18

    Keywords

    • Alignments
    • Conformance checking
    • Process mining

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

    Cite this