Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns
From MaRDI portal
Publication:6189320
Abstract: In process discovery, the goal is to find, for a given event log, the model describing the underlying process. While process models can be represented in a variety of ways, Petri nets form a theoretically well-explored description language and are therefore often used in process mining. In this paper, we present an extension of the eST-Miner process discovery algorithm. The eST-Miner computes a set of Petri net places which are considered to be fitting with respect to a certain fraction of the behavior described by the given event log as indicated by a given noise threshold. It evaluates all possible candidate places using token-based replay. The set of replayable traces is determined for each place in isolation, i.e., these sets do not need to be consistent. This allows the algorithm to abstract from infrequent behavioral patterns occuring only in some traces. When combining these places into a Petri net by connecting them to the corresponding uniquely labeled transitions, the resulting net can replay exactly those traces from the event log that are allowed by the combination of all inserted places. Thus, inserting places one-by-one without considering their combined effect may result in deadlocks and low fitness of the Petri net. In this paper, we explore adaptions of the eST-Miner, that aim to select a subset of places such that the resulting Petri net guarantees a definable minimal fitness while maintaining high precision with respect to the input event log. Furthermore, current place evaluation techniques tend to block the execution of infrequent activity labels. Thus, a refined place fitness metric is introduced and thoroughly investigated. Furthermore, various place selection strategies are proposed and their impact on the returned Petri net is evaluated by experiments using both real and artificial event logs.
Cites work
- A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
- Applications and Theory of Petri Nets 2005
- Automated repair of process models using non-local constraints
- Discovering process models with long-term dependencies while providing guarantees and handling infrequent behavior
- Free Choice Petri Nets
- scientific article; zbMATH DE number 4033100 (Why is no real title available?)
- scientific article; zbMATH DE number 1305001 (Why is no real title available?)
- Partial (set) 2-structures. II: State spaces of concurrent systems
- Petri Net Reductions for Counting Markings
- Petri net synthesis
- Synthesis of Petri nets from finite partial languages
- Understanding Petri Nets
This page was built for publication: Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6189320)
