Sciweavers

JCSS
2010

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

13 years 9 months ago
Simplified proof of the blocking theorem for free-choice Petri nets
: 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.
Joachim Wehler
Added 28 Jan 2011
Updated 28 Jan 2011
Type Journal
Year 2010
Where JCSS
Authors Joachim Wehler
Comments (0)