Within the research domain of process mining, process discovery aims at constructing a process model as an abstract representation of an event log. The goal is to build a model (e.g., a Petri net) that provides insight into the behavior captured in the log. The theory of regions can be used to transform a state-based model or a set of words into a Petri net that exactly mimics the behavior given as input. Recently several papers appeared on the application of the theory of regions for process discovery. This paper provides an overview of different Petri net based discovery algorithms from both the area of process mining and the theory of regions. The overview encompasses five categories of algorithms, for which common assumptions and problems are indicated. Furthermore, based on the shortcomings of the algorithms in each category, a set of directions for future research in the process discovery area is discussed.
|Title of host publication||Transactions on Petri Nets and Other Models of Concurrency II|
|Editors||K. Jensen, W.M.P. Aalst, van der|
|Place of Publication||Berlin|
|Publication status||Published - 2009|
|Name||Lecture Notes in Computer Science|
Dongen, van, B. F., Alves De Medeiros, A. K., & Wen, L. (2009). Process mining : overview and outlook of Petri net discovery algorithms. In K. Jensen, & W. M. P. Aalst, van der (Eds.), Transactions on Petri Nets and Other Models of Concurrency II (pp. 225-242). (Lecture Notes in Computer Science; Vol. 5460). Berlin: Springer. https://doi.org/10.1007/978-3-642-00899-3_13