This paper provides three aggregation algorithms for deriving system nets from sets of partially-ordered causal runs. The three algorithms differ with respect to the assumptions about the information contained in the causal runs. Specifically, we look at the situations where labels of conditions (i.e. references to places) or events (i.e. references to transitions) are unknown. Since the paper focuses on aggregation in the context of process mining, we solely look at workflow nets, i.e. a class of Petri nets with unique start and end places. The difference of the work presented here and most work on process mining is the assumption that events are logged as partial orders instead of linear traces. Although the work is inspired by applications in the process mining and workflow domains, the results are generic and can be applied in other application domains.
|Title of host publication||Transactions on Petri Nets and Other Models of Concurrency VI|
|Editors||K. Jensen, W.M.P. Aalst, van der, M. Ajmone Marsan, G. Franceschinis, J. Kleijn, L.M. Kristensen|
|Place of Publication||Berlin|
|Publication status||Published - 2012|
|Name||Lecture Notes in Computer Science|
Dongen, van, B. F., Desel, J., & Aalst, van der, W. M. P. (2012). Aggregating causal runs into workflow nets. In K. Jensen, W. M. P. Aalst, van der, M. Ajmone Marsan, G. Franceschinis, J. Kleijn, & L. M. Kristensen (Eds.), Transactions on Petri Nets and Other Models of Concurrency VI (pp. 334-363). (Lecture Notes in Computer Science; Vol. 7400). Berlin: Springer. https://doi.org/10.1007/978-3-642-35179-2_14