Firing partial orders in a Petri net

DOI10.1007/978-3-030-76983-3_20zbMath1489.68151OpenAlexW3168298431MaRDI QIDQ2117188

Robin Bergenthum

Publication date: 21 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-76983-3_20

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Uses Software

• VipTool

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modular construction and partial order semantics of Petri nets
• Verification of Scenarios in Petri Nets Using Compact Tokenflows
• Process Mining Reloaded: Event Structures as a Unified Representation of Process Models and Event Logs
• Maximal Flow Through a Network
• Faster Unfolding of General Petri Nets Based on Token Flows
• Oclets – Scenario-Based Modeling with Petri Nets
• Understanding Petri Nets
• Discovering Petri Nets from Event Logs
• Faster Verification of Partially Ordered Runs in Petri Nets Using Compact Tokenflows
• Applications and Theory of Petri Nets 2005
• Finding Complex Process-Structures by Exploiting the Token-Game

This page was built for publication: Firing partial orders in a Petri net