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

作者:

Highlights:

摘要

Every cluster in a bounded and live free-choice system has a unique blocking marking. It can be reached by firing an occurrence sequence, which avoids any transition of the cluster. This theorem is due to Gaujal, Haar and Mairesse. We will give a short proof using standard results on CP-subnets of well-formed free-choice nets.

论文关键词:Blocking marking,CP-subnet,Free-choice system

论文评审过程:Received 22 December 2008, Revised 13 August 2009, Available online 8 October 2009.

论文官网地址:https://doi.org/10.1016/j.jcss.2009.10.001