Aggregating causal runs into workflow nets

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureHoofdstukAcademic

1 Citaat (Scopus)

Samenvatting

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.
Originele taal-2Engels
TitelTransactions on Petri Nets and Other Models of Concurrency VI
RedacteurenK. Jensen, W.M.P. Aalst, van der, M. Ajmone Marsan, G. Franceschinis, J. Kleijn, L.M. Kristensen
Plaats van productieBerlin
UitgeverijSpringer
Pagina's334-363
ISBN van geprinte versie978-3-642-35178-5
DOI's
StatusGepubliceerd - 2012

Publicatie series

NaamLecture Notes in Computer Science
Volume7400
ISSN van geprinte versie0302-9743

Vingerafdruk Duik in de onderzoeksthema's van 'Aggregating causal runs into workflow nets'. Samen vormen ze een unieke vingerafdruk.

  • Citeer dit

    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 (editors), Transactions on Petri Nets and Other Models of Concurrency VI (blz. 334-363). (Lecture Notes in Computer Science; Vol. 7400). Springer. https://doi.org/10.1007/978-3-642-35179-2_14