Hybrid Petri Net Miner

This node implements the second step of the Hybrid Miner to discover a hybrid Petri net from a causal graph. The hybrid miner converts the edges of the input causal graph into formal places if there is enough evidence in the data justifying adding formal constraints. A hybrid Petri net can also contain arcs directly connecting transitions to indicate informal dependencies between them. We distinguish three types of informal arcs: (1) strong dependencies are represented by blue solid arcs (certain arcs); (2) weak dependencies are represented by red dotted arcs (uncertain arcs); (3) long-term dependencies are represented by orange solid arcs.

Options

Threshold for Cancellation of Place Iterator

Threshold for early cancellation of place iterator: after x consecutive rejected places, the place iterator is canceled.

Fitness Threshold

Fitness threshold for the place evaluation method.

Place evaluation method

Place evaluation method.

Views

Interactive View: Hybrid Petri Net

Workflows

• 00_Process_Mining_with_Community_NodesKNIME Hub
• Discovery of Hybrid Process ModelsKNIME Hub

Links

• No links available

Developers