Aggregating Causal Runs into Workflow Nets

Applications of Region Theory 2011.

社会科学（总论）;计算机科学

B.F. van Dongen ; J. Desel ; W.M.P. van der Aalst

Others  :  http://ceur-ws.org/Vol-725/paper03.pdf
PID  :  41694

来源: CEUR

【 摘 要 】

This paper provides three algorithms for constructing system nets from sets of partially-ordered causal runs. The three aggregation 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 focusses on aggregation in the context of process mining, we solely look at workflow nets, i.e. the 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.