A recursive algorithm transforms workflow nets into POWL 2.0 models with formal proofs of language preservation and completeness for separable nets, succeeding on 1,493 benchmark models.
Circuits, handles, bridges and nets
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DB 2verdicts
UNVERDICTED 2representative citing papers
Extends eST-Miner with place selection for guaranteed minimal fitness and a refined place fitness metric for infrequent behavior in process discovery from event logs.
citing papers explorer
-
Hierarchical Decomposition of Separable Workflow-Nets
A recursive algorithm transforms workflow nets into POWL 2.0 models with formal proofs of language preservation and completeness for separable nets, succeeding on 1,493 benchmark models.
-
Discovering Process Models With Long-Term Dependencies While Providing Guarantees and Filtering Infrequent Behavior Patterns
Extends eST-Miner with place selection for guaranteed minimal fitness and a refined place fitness metric for infrequent behavior in process discovery from event logs.