Aggregating causal runs into workflow nets

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

1 Citation (Scopus)

Abstract

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.
Original languageEnglish
Title of host publicationTransactions on Petri Nets and Other Models of Concurrency VI
EditorsK. Jensen, W.M.P. Aalst, van der, M. Ajmone Marsan, G. Franceschinis, J. Kleijn, L.M. Kristensen
Place of PublicationBerlin
PublisherSpringer
Pages334-363
ISBN (Print)978-3-642-35178-5
DOIs
Publication statusPublished - 2012

Publication series

NameLecture Notes in Computer Science
Volume7400
ISSN (Print)0302-9743

Fingerprint Dive into the research topics of 'Aggregating causal runs into workflow nets'. Together they form a unique fingerprint.

  • Cite this

    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