ILP Miner

This node implements the ILP 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.
Filter Type
The filter type includes the following choices:
  • NONE: no filter.
  • SEQUENCE_ENCODING: the sequence encoding filter specifies at what level a branch should be cut off.
  • SLACK_VAR: the slack variable filter specifies what portion of constraints should be filtered out.
Noise Threshold
Threshold for filtering out noise.
Objective Function
The objective function for ILP. The following options are supported:
  • WEIGHTED_ABSOLUTE_PARIKH: weighted parikh values, using absolute frequencies.
  • WEIGHTED_RELATIVE_PARIKH: weighted parikh values, using relative frequencies.
  • UNWEIGHTED_PARIKH: unweighted parikh values.
  • MINIMIZE_ARCS: minimize arcs.
Variable Distribution
Setting LP variable. The following options are supported:
  • DUAL: two variables per event.
  • HYBRID: one variable per event, two for an event which is potentially in a self loop.
  • SINGLE: one variable per event.
Discovery Strategy
The Discovery Strategy. The following options are supported:
  • CAUSAL_FLEX_HEUR: mine a place per causal relation (flexible heuristics miner).
  • TRANSITION_PAIR: mine a connecting place between each pair of transitions.

Input Ports

Icon
an event table

Output Ports

Icon
a Petri net

Popular Predecessors

  • No recommendations found

Popular Successors

  • No recommendations found

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.