Simplified proof of the blocking theorem for free-choice Petri nets

DOI10.1016/j.jcss.2009.10.001zbMath1197.68055OpenAlexW2090307337MaRDI QIDQ988568

Joachim Wehler

Publication date: 18 August 2010

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2009.10.001

zbMATH Keywords

blocking markingCP-subnetfree-choice system

Mathematics Subject Classification ID

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

Related Items (3)

Free-choice Nets with Home Clusters are Lucent ⋮ Perpetual Free-choice Petri Nets are Lucent Proof of a Theorem of van der Aalst Using CP-exhaustions ⋮ Reduction using induced subnets to systematically prove properties for free-choice nets

Cites Work

• A theory of bipolar synchronization scheme
• Blocking a transition in a free choice net and what it tells about its throughput.
• Free Choice Petri Nets

This page was built for publication: Simplified proof of the blocking theorem for free-choice Petri nets