Efficiently computing alignments: algorithm and datastructures

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

4 Citaten (Scopus)
6 Downloads (Pure)

Samenvatting

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.

Originele taal-2Engels
TitelBusiness Process Management Workshops - BPM 2018 International Workshops, Revised Papers
RedacteurenFlorian Daniel, Quan Z. Sheng, Hamid Motahari
UitgeverijSpringer
Pagina's44-55
Aantal pagina's12
ISBN van geprinte versie9783030116408
DOI's
StatusGepubliceerd - 29 jan. 2019
Evenement16th International Conference on Business Process Management (BPM 2018) - Sydney, Australië
Duur: 9 sep. 201814 sep. 2018
Congresnummer: 16
http://ceur-ws.org/Vol-2196/

Publicatie series

NaamLecture Notes in Business Information Processing
Volume342
ISSN van geprinte versie1865-1348

Congres

Congres16th International Conference on Business Process Management (BPM 2018)
Verkorte titelBPM 2018
Land/RegioAustralië
StadSydney
Periode9/09/1814/09/18
Internet adres

Vingerafdruk

Duik in de onderzoeksthema's van 'Efficiently computing alignments: algorithm and datastructures'. Samen vormen ze een unieke vingerafdruk.

Citeer dit