Firing partial orders in a Petri net
From MaRDI portal
Publication:2117188
Recommendations
Cites work
- Applications and Theory of Petri Nets 2005
- Discovering Petri nets from event logs
- Faster Unfolding of General Petri Nets Based on Token Flows
- Faster verification of partially ordered runs in Petri nets using compact tokenflows
- Finding Complex Process-Structures by Exploiting the Token-Game
- scientific article; zbMATH DE number 3829262 (Why is no real title available?)
- scientific article; zbMATH DE number 4087033 (Why is no real title available?)
- scientific article; zbMATH DE number 3722109 (Why is no real title available?)
- scientific article; zbMATH DE number 3735177 (Why is no real title available?)
- scientific article; zbMATH DE number 3475221 (Why is no real title available?)
- scientific article; zbMATH DE number 1302043 (Why is no real title available?)
- scientific article; zbMATH DE number 1973117 (Why is no real title available?)
- Maximal Flow Through a Network
- Modular construction and partial order semantics of Petri nets
- Network flows. Theory, algorithms, and applications.
- Oclets – Scenario-Based Modeling with Petri Nets
- Process Mining Reloaded: Event Structures as a Unified Representation of Process Models and Event Logs
- Understanding Petri Nets
- Verification of scenarios in Petri nets using compact tokenflows
Cited in
(3)
This page was built for publication: Firing partial orders in a Petri net
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117188)