| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429672 | Journal of Computer and System Sciences | 2010 | 6 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
