This node converts a KNIME Data Table into a Petri net. 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
Views
- Interactive View: Petri Net
Workflows
Links
- No links available
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.