Rust · WebAssemblyDiscovery
Inductive Miner
run.promenade.inductive-miner
Leemans' Inductive Miner (IM and IMf) in Rust: recursively cuts the directly-follows graph into a block-structured process tree. Always returns a sound model — unlike Alpha Miner it cannot fail — and IMf tolerates infrequent behavior without giving that up. Verified against ProM's own implementation over ~208,000 differential cases.
Produces
- ProcessTree
Runtimes
- Rust · WebAssemblyCompiled to WebAssembly, runs in the page or on an engine
Works well with
- View · TypeScript0.1.5Process Tree View
draws the process trees this plugin produces
Versions
| Version | Released | Size | Notes |
|---|---|---|---|
| 0.1.2latest | 17 Aug 2026 | 113 KB | "Activity limit" renamed to "Distinct activities": it read as though it capped events. There is no event limit here — every event is read, however many. The Road Traffic Fine Management log (561,470 events, 11 distinct activities) mines in 796 ms with nothing dropped. The pm4py plugin's "Event limit" is a different quantity: it truncates the log because pm4py holds it in memory as a DataFrame. |