Alpha Miner

This node implements the Alpha Miner to discover a Petri net from an event table. A Petri net is a directed bipartite graph used to model processes. It consists of places, transitions, and directed arcs connecting them. A place is enabled if it it contains at least one token. A transition can only fire if all incoming places are enabled. After firing a transition, a token is consumed from all of its incoming places, and a token is produced in all of its outgoing places. The initial marking indicates the initial state of the Petri net. Places that belong to the initial marking are marked by green tokens inside them. The final marking denotes the final state of the Petri net. Places within the final marking are highlighted with a heavier border.

Options

Case ID
The column that contains the case/trace identifiers.
Activity
The column that contains the activity/event identifiers.
Timestamp
The column that contains the timestamps.
Alpha Variant
The Alpha miner variant to be applied. Five variants are supported: Alpha, Alpha+, Alpha++, Alpha#, and AlphaR.
Noise Threshold for Least Frequency
This parameter sets the least frequency noise threshold for the AlphaR variant.
Noise Threshold for Most Frequency
This parameter sets the most frequency noise threshold for the AlphaR variant.
Casual Threshold
This parameter sets the casual threshold for the AlphaR variant.
Ignore the length of the loops
This parameter sets whether the Alpha+ variant ignores loop length or not.

Input Ports

Icon
an event table

Output Ports

Icon
a Petri net

Views

Interactive View: Petri Net

Workflows

  • No workflows found

Links

Developers

You want to see the source code for this node? Click the following button and we’ll use our super-powers to find it for you.