  Van der Aalst's theorem is an important result for the analysis and synthesis
of process models. The paper proves the theorem by exhausting perpetual
free-choice Petri nets by CP-subnets. The resulting T-systems are investigated
by elementary methods.
