Efficiently computing alignments: algorithm and datastructures

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

3 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 International Workshops 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 International Workshops 2018
CountryAustralia
CitySydney
Period9/09/1814/09/18

Fingerprint

Data Structures
Alignment
Time Complexity
Computing
Data storage equipment
Space Complexity
Java
Parallelism
Data structures
Model
Experiment
Experiments

Keywords

  • Alignments
  • Conformance checking
  • Process mining

Cite this

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. https://doi.org/10.1007/978-3-030-11641-5_4
van Dongen, Boudewijn F. / Efficiently computing alignments : algorithm and datastructures. Business Process Management Workshops - BPM 2018 International Workshops, Revised Papers. editor / Florian Daniel ; Quan Z. Sheng ; Hamid Motahari. Springer, 2019. pp. 44-55 (Lecture Notes in Business Information Processing).
@inproceedings{7291f3c7fb39471ba3c52f4a67202dd1,
title = "Efficiently computing alignments: algorithm and datastructures",
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.",
keywords = "Alignments, Conformance checking, Process mining",
author = "{van Dongen}, {Boudewijn F.}",
year = "2019",
month = "1",
day = "29",
doi = "10.1007/978-3-030-11641-5_4",
language = "English",
isbn = "9783030116408",
series = "Lecture Notes in Business Information Processing",
publisher = "Springer",
pages = "44--55",
editor = "Florian Daniel and Sheng, {Quan Z.} and Hamid Motahari",
booktitle = "Business Process Management Workshops - BPM 2018 International Workshops, Revised Papers",
address = "Germany",

}

van Dongen, BF 2019, Efficiently computing alignments: algorithm and datastructures. in F Daniel, QZ Sheng & H Motahari (eds), Business Process Management Workshops - BPM 2018 International Workshops, Revised Papers. Lecture Notes in Business Information Processing, vol. 342, Springer, pp. 44-55, 16th International Conference on Business Process Management, BPM International Workshops 2018, Sydney, Australia, 9/09/18. https://doi.org/10.1007/978-3-030-11641-5_4

Efficiently computing alignments : algorithm and datastructures. / van Dongen, Boudewijn F.

Business Process Management Workshops - BPM 2018 International Workshops, Revised Papers. ed. / Florian Daniel; Quan Z. Sheng; Hamid Motahari. Springer, 2019. p. 44-55 (Lecture Notes in Business Information Processing; Vol. 342).

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

TY - GEN

T1 - Efficiently computing alignments

T2 - algorithm and datastructures

AU - van Dongen, Boudewijn F.

PY - 2019/1/29

Y1 - 2019/1/29

N2 - 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.

AB - 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.

KW - Alignments

KW - Conformance checking

KW - Process mining

UR - http://www.scopus.com/inward/record.url?scp=85061389800&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-11641-5_4

DO - 10.1007/978-3-030-11641-5_4

M3 - Conference contribution

AN - SCOPUS:85061389800

SN - 9783030116408

T3 - Lecture Notes in Business Information Processing

SP - 44

EP - 55

BT - Business Process Management Workshops - BPM 2018 International Workshops, Revised Papers

A2 - Daniel, Florian

A2 - Sheng, Quan Z.

A2 - Motahari, Hamid

PB - Springer

ER -

van Dongen BF. Efficiently computing alignments: algorithm and datastructures. In Daniel F, Sheng QZ, Motahari H, editors, Business Process Management Workshops - BPM 2018 International Workshops, Revised Papers. Springer. 2019. p. 44-55. (Lecture Notes in Business Information Processing). https://doi.org/10.1007/978-3-030-11641-5_4