Reduction using induced subnets to systematically prove properties for free-choice nets

DOI10.1007/978-3-030-76983-3_11zbMath1489.68171arXiv2106.03658OpenAlexW3173428618MaRDI QIDQ2117169

Wil M. P. van der Aalst

Publication date: 21 March 2022

Full work available at URL: https://arxiv.org/abs/2106.03658

zbMATH Keywords

Petri netsnet reductionfree-choice netslucency

Mathematics Subject Classification ID

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

Related Items (1)

Free-choice Nets with Home Clusters are Lucent

Cites Work

• Unnamed Item
• Simplified proof of the blocking theorem for free-choice Petri nets
• Blocking a transition in a free choice net and what it tells about its throughput.
• Shortest paths in reachability graphs
• Markings in perpetual free-choice nets are fully characterized by their enabled transitions
• A fresh look at free choice nets
• Structure Theory of Petri Nets
• Free-choice Nets with Home Clusters are Lucent
• Lucent Process Models and Translucent Event Logs

This page was built for publication: Reduction using induced subnets to systematically prove properties for free-choice nets