Maximizing Synchronization for Aligning Observed and Modelled Behaviour

Vincent Bloemen, S.J. van Zelst, W.M.P. van der Aalst, B.F. van Dongen, Jaco van de Pol

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

5 Citations (Scopus)
80 Downloads (Pure)

Abstract

Conformance checking is a branch of process mining that aims to assess to what degree event data originating from the execution of a (business) process and a corresponding reference model conform to each other. Alignments have been recently introduced as a solution for conformance checking and have since rapidly developed into becoming the de facto standard.

The state-of-the-art method to compute alignments is based on solving a shortest path problem derived from the reference model and the event data. Within such a shortest path problem, a cost function is used to guide the search to an optimal solution. The standard cost-function treats mismatches in the model and log as equal. In this paper, we consider a variant of this standard cost function which maximizes the number of correct matches instead. We study the effects of using this cost-function compared to the standard cost function on both small and large models using over a thousand generated and industrial case studies.

We further show that the alignment computation process can be sped up significantly in specific instances. Finally, we present a new algorithm for the computation of alignments on models with many log traces that is an order of magnitude faster (in maximizing synchronous moves) compared to the state-of-the-art A* based solution method, as a result of a preprocessing step on the model.
Original languageEnglish
Title of host publicationBusiness Process Management
Subtitle of host publication16th International Conference, BPM 2018, Sydney, NSW, Australia, September 9–14, 2018, Proceedings
EditorsMathias Weske, Marco Montali, Jan vom Brocke, Ingo Weber
Place of PublicationCham
PublisherSpringer
Pages233-249
Number of pages17
Volume11080
ISBN (Electronic)978-3-319-98648-7
ISBN (Print)978-3-319-98648-7
DOIs
Publication statusPublished - 2018
Event16th International Conference on Business Process Management 2018 - University of Technology, Sydney, Australia
Duration: 9 Sep 201814 Sep 2018
Conference number: 16
http://bpm2018.web.cse.unsw.edu.au

Conference

Conference16th International Conference on Business Process Management 2018
Abbreviated titleBPM 2018
CountryAustralia
CitySydney
Period9/09/1814/09/18
Internet address

Fingerprint

Synchronization
Cost functions
Industry

Cite this

Bloemen, V., van Zelst, S. J., van der Aalst, W. M. P., van Dongen, B. F., & van de Pol, J. (2018). Maximizing Synchronization for Aligning Observed and Modelled Behaviour. In M. Weske, M. Montali, J. vom Brocke, & I. Weber (Eds.), Business Process Management: 16th International Conference, BPM 2018, Sydney, NSW, Australia, September 9–14, 2018, Proceedings (Vol. 11080, pp. 233-249). Cham: Springer. https://doi.org/10.1007/978-3-319-98648-7_14
Bloemen, Vincent ; van Zelst, S.J. ; van der Aalst, W.M.P. ; van Dongen, B.F. ; van de Pol, Jaco . / Maximizing Synchronization for Aligning Observed and Modelled Behaviour. Business Process Management: 16th International Conference, BPM 2018, Sydney, NSW, Australia, September 9–14, 2018, Proceedings. editor / Mathias Weske ; Marco Montali ; Jan vom Brocke ; Ingo Weber. Vol. 11080 Cham : Springer, 2018. pp. 233-249
@inproceedings{a7410fc293324a2db8bded8efc81fc35,
title = "Maximizing Synchronization for Aligning Observed and Modelled Behaviour",
abstract = "Conformance checking is a branch of process mining that aims to assess to what degree event data originating from the execution of a (business) process and a corresponding reference model conform to each other. Alignments have been recently introduced as a solution for conformance checking and have since rapidly developed into becoming the de facto standard.The state-of-the-art method to compute alignments is based on solving a shortest path problem derived from the reference model and the event data. Within such a shortest path problem, a cost function is used to guide the search to an optimal solution. The standard cost-function treats mismatches in the model and log as equal. In this paper, we consider a variant of this standard cost function which maximizes the number of correct matches instead. We study the effects of using this cost-function compared to the standard cost function on both small and large models using over a thousand generated and industrial case studies.We further show that the alignment computation process can be sped up significantly in specific instances. Finally, we present a new algorithm for the computation of alignments on models with many log traces that is an order of magnitude faster (in maximizing synchronous moves) compared to the state-of-the-art A* based solution method, as a result of a preprocessing step on the model.",
author = "Vincent Bloemen and {van Zelst}, S.J. and {van der Aalst}, W.M.P. and {van Dongen}, B.F. and {van de Pol}, Jaco",
year = "2018",
doi = "10.1007/978-3-319-98648-7_14",
language = "English",
isbn = "978-3-319-98648-7",
volume = "11080",
pages = "233--249",
editor = "Mathias Weske and Marco Montali and {vom Brocke}, Jan and Ingo Weber",
booktitle = "Business Process Management",
publisher = "Springer",

}

Bloemen, V, van Zelst, SJ, van der Aalst, WMP, van Dongen, BF & van de Pol, J 2018, Maximizing Synchronization for Aligning Observed and Modelled Behaviour. in M Weske, M Montali, J vom Brocke & I Weber (eds), Business Process Management: 16th International Conference, BPM 2018, Sydney, NSW, Australia, September 9–14, 2018, Proceedings. vol. 11080, Springer, Cham, pp. 233-249, 16th International Conference on Business Process Management 2018, Sydney, Australia, 9/09/18. https://doi.org/10.1007/978-3-319-98648-7_14

Maximizing Synchronization for Aligning Observed and Modelled Behaviour. / Bloemen, Vincent ; van Zelst, S.J.; van der Aalst, W.M.P.; van Dongen, B.F.; van de Pol, Jaco .

Business Process Management: 16th International Conference, BPM 2018, Sydney, NSW, Australia, September 9–14, 2018, Proceedings. ed. / Mathias Weske; Marco Montali; Jan vom Brocke; Ingo Weber. Vol. 11080 Cham : Springer, 2018. p. 233-249.

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

TY - GEN

T1 - Maximizing Synchronization for Aligning Observed and Modelled Behaviour

AU - Bloemen, Vincent

AU - van Zelst, S.J.

AU - van der Aalst, W.M.P.

AU - van Dongen, B.F.

AU - van de Pol, Jaco

PY - 2018

Y1 - 2018

N2 - Conformance checking is a branch of process mining that aims to assess to what degree event data originating from the execution of a (business) process and a corresponding reference model conform to each other. Alignments have been recently introduced as a solution for conformance checking and have since rapidly developed into becoming the de facto standard.The state-of-the-art method to compute alignments is based on solving a shortest path problem derived from the reference model and the event data. Within such a shortest path problem, a cost function is used to guide the search to an optimal solution. The standard cost-function treats mismatches in the model and log as equal. In this paper, we consider a variant of this standard cost function which maximizes the number of correct matches instead. We study the effects of using this cost-function compared to the standard cost function on both small and large models using over a thousand generated and industrial case studies.We further show that the alignment computation process can be sped up significantly in specific instances. Finally, we present a new algorithm for the computation of alignments on models with many log traces that is an order of magnitude faster (in maximizing synchronous moves) compared to the state-of-the-art A* based solution method, as a result of a preprocessing step on the model.

AB - Conformance checking is a branch of process mining that aims to assess to what degree event data originating from the execution of a (business) process and a corresponding reference model conform to each other. Alignments have been recently introduced as a solution for conformance checking and have since rapidly developed into becoming the de facto standard.The state-of-the-art method to compute alignments is based on solving a shortest path problem derived from the reference model and the event data. Within such a shortest path problem, a cost function is used to guide the search to an optimal solution. The standard cost-function treats mismatches in the model and log as equal. In this paper, we consider a variant of this standard cost function which maximizes the number of correct matches instead. We study the effects of using this cost-function compared to the standard cost function on both small and large models using over a thousand generated and industrial case studies.We further show that the alignment computation process can be sped up significantly in specific instances. Finally, we present a new algorithm for the computation of alignments on models with many log traces that is an order of magnitude faster (in maximizing synchronous moves) compared to the state-of-the-art A* based solution method, as a result of a preprocessing step on the model.

U2 - 10.1007/978-3-319-98648-7_14

DO - 10.1007/978-3-319-98648-7_14

M3 - Conference contribution

SN - 978-3-319-98648-7

VL - 11080

SP - 233

EP - 249

BT - Business Process Management

A2 - Weske, Mathias

A2 - Montali, Marco

A2 - vom Brocke, Jan

A2 - Weber, Ingo

PB - Springer

CY - Cham

ER -

Bloemen V, van Zelst SJ, van der Aalst WMP, van Dongen BF, van de Pol J. Maximizing Synchronization for Aligning Observed and Modelled Behaviour. In Weske M, Montali M, vom Brocke J, Weber I, editors, Business Process Management: 16th International Conference, BPM 2018, Sydney, NSW, Australia, September 9–14, 2018, Proceedings. Vol. 11080. Cham: Springer. 2018. p. 233-249 https://doi.org/10.1007/978-3-319-98648-7_14