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.