New rank theorems for Petri nets and their application to workflow management
Andrei Kovalyov, Robert D. McLeod · 2002
New Rank Theorems for Petri nets are given. These theorems are stronger than the known ones in the sense that the new necessary and sufficient conditions of well-formedness are weaker than the known ones. We show how these theorems can be used in the analysis of workflow procedures.