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 language | English |
---|---|
Title of host publication | Business Process Management Workshops - BPM 2018 International Workshops, Revised Papers |
Editors | Florian Daniel, Quan Z. Sheng, Hamid Motahari |
Publisher | Springer |
Pages | 44-55 |
Number of pages | 12 |
ISBN (Print) | 9783030116408 |
DOIs | |
Publication status | Published - 29 Jan 2019 |
Event | 16th International Conference on Business Process Management (BPM 2018) - Sydney, Australia Duration: 9 Sept 2018 → 14 Sept 2018 Conference number: 16 http://ceur-ws.org/Vol-2196/ |
Publication series
Name | Lecture Notes in Business Information Processing |
---|---|
Volume | 342 |
ISSN (Print) | 1865-1348 |
Conference
Conference | 16th International Conference on Business Process Management (BPM 2018) |
---|---|
Abbreviated title | BPM 2018 |
Country/Territory | Australia |
City | Sydney |
Period | 9/09/18 → 14/09/18 |
Other | Dissertation Award, Demonstration, and Industrial Track at BPM |
Internet address |
Keywords
- Alignments
- Conformance checking
- Process mining