Discovering an S-Coverable WF-net using DiSCover

Verbeek, H. M. W. (2022). Discovering an S-Coverable WF-net using DiSCover. In A. Burattin, A. Polyvyanyy, & B. Weber (Eds.), Proceedings of the 2022 4th International Conference on Process Mining (ICPM 2022) (pp. 64-71). IEEE Press.


Although many algorithms exist that can discover a WF-net from an event log, only a few (if any at all) can discover advanced routing constructs. As examples, the Inductive miner uses process trees and cannot discover complex loops, or situations where choice and parallel behavior is mixed, and the Hybrid ILP miner cannot discover certain complex routing constructs because it cannot discover silent transitions. This paper introduces the DiSCover miner, a discovery algorithm that can discover these more complex constructs and that is implemented in ProM. The DiSCover miner discovers from the event log a WF-net that corresponds to a collection of state machines that need to synchronize on the visible transitions (that is, on the activities from the event log). As such, it discovers a WF-net that is S-Coverable but not necessarily sound. Initial results show that it can discover complex routing constructs and that it performs well on the data sets of the different Process Discovery Contests. It even preformed better than winners of the 2020 and 2021 contests.

Leave a Reply