Online conformance checking: relating event streams to process models using prefix-alignments

S.J. van Zelst (Corresponding author), A.J. Bolt Irondio, M. Hassani, B.F. van Dongen, W.M.P. van der Aalst

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

4 Downloads (Pure)

Uittreksel

Companies often specify the intended behaviour of their business processes in a process model. Conformance checking techniques allow us to assess to what degree such process models and corresponding process execution data correspond to one another. In recent years, alignments have proven extremely useful for calculating conformance checking statistics. Existing techniques to compute alignments have been developed to be used in an offline, a posteriori setting. However, we are often interested in observing deviations at the moment they occur, rather than days, weeks or even months later. Hence, we need techniques that enable us to perform conformance checking in an online setting. In this paper, we present a novel approach to incrementally compute prefix-alignments, paving the way for real-time online conformance checking. Our experiments show that the reuse of previously computed prefix-alignments enhances memory efficiency, whilst preserving prefix-alignment optimality. Moreover, we show that, in case of computing approximate prefix-alignments, there is a clear trade-off between memory efficiency and approximation error.
Originele taal-2Engels
Pagina's (van-tot)269-284
TijdschriftInternational Journal of Data Science and Analytics
Volume8
Nummer van het tijdschrift3
DOI's
StatusGepubliceerd - okt 2019

Vingerafdruk

Data storage equipment
Industry
Statistics
Experiments

Citeer dit

@article{5f0e058f37ef424d83d4a37eb0901f04,
title = "Online conformance checking: relating event streams to process models using prefix-alignments",
abstract = "Companies often specify the intended behaviour of their business processes in a process model. Conformance checking techniques allow us to assess to what degree such process models and corresponding process execution data correspond to one another. In recent years, alignments have proven extremely useful for calculating conformance checking statistics. Existing techniques to compute alignments have been developed to be used in an offline, a posteriori setting. However, we are often interested in observing deviations at the moment they occur, rather than days, weeks or even months later. Hence, we need techniques that enable us to perform conformance checking in an online setting. In this paper, we present a novel approach to incrementally compute prefix-alignments, paving the way for real-time online conformance checking. Our experiments show that the reuse of previously computed prefix-alignments enhances memory efficiency, whilst preserving prefix-alignment optimality. Moreover, we show that, in case of computing approximate prefix-alignments, there is a clear trade-off between memory efficiency and approximation error.",
author = "{van Zelst}, S.J. and {Bolt Irondio}, A.J. and M. Hassani and {van Dongen}, B.F. and {van der Aalst}, W.M.P.",
year = "2019",
month = "10",
doi = "10.1007/s41060-017-0078-6",
language = "English",
volume = "8",
pages = "269--284",
journal = "International Journal of Data Science and Analytics",
issn = "2364-415X",
publisher = "Springer",
number = "3",

}

Online conformance checking: relating event streams to process models using prefix-alignments. / van Zelst, S.J. (Corresponding author); Bolt Irondio, A.J.; Hassani, M.; van Dongen, B.F.; van der Aalst, W.M.P.

In: International Journal of Data Science and Analytics, Vol. 8, Nr. 3, 10.2019, blz. 269-284.

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

TY - JOUR

T1 - Online conformance checking: relating event streams to process models using prefix-alignments

AU - van Zelst, S.J.

AU - Bolt Irondio, A.J.

AU - Hassani, M.

AU - van Dongen, B.F.

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

PY - 2019/10

Y1 - 2019/10

N2 - Companies often specify the intended behaviour of their business processes in a process model. Conformance checking techniques allow us to assess to what degree such process models and corresponding process execution data correspond to one another. In recent years, alignments have proven extremely useful for calculating conformance checking statistics. Existing techniques to compute alignments have been developed to be used in an offline, a posteriori setting. However, we are often interested in observing deviations at the moment they occur, rather than days, weeks or even months later. Hence, we need techniques that enable us to perform conformance checking in an online setting. In this paper, we present a novel approach to incrementally compute prefix-alignments, paving the way for real-time online conformance checking. Our experiments show that the reuse of previously computed prefix-alignments enhances memory efficiency, whilst preserving prefix-alignment optimality. Moreover, we show that, in case of computing approximate prefix-alignments, there is a clear trade-off between memory efficiency and approximation error.

AB - Companies often specify the intended behaviour of their business processes in a process model. Conformance checking techniques allow us to assess to what degree such process models and corresponding process execution data correspond to one another. In recent years, alignments have proven extremely useful for calculating conformance checking statistics. Existing techniques to compute alignments have been developed to be used in an offline, a posteriori setting. However, we are often interested in observing deviations at the moment they occur, rather than days, weeks or even months later. Hence, we need techniques that enable us to perform conformance checking in an online setting. In this paper, we present a novel approach to incrementally compute prefix-alignments, paving the way for real-time online conformance checking. Our experiments show that the reuse of previously computed prefix-alignments enhances memory efficiency, whilst preserving prefix-alignment optimality. Moreover, we show that, in case of computing approximate prefix-alignments, there is a clear trade-off between memory efficiency and approximation error.

U2 - 10.1007/s41060-017-0078-6

DO - 10.1007/s41060-017-0078-6

M3 - Article

VL - 8

SP - 269

EP - 284

JO - International Journal of Data Science and Analytics

JF - International Journal of Data Science and Analytics

SN - 2364-415X

IS - 3

ER -