Liveness for Synchronized Choice Petri Nets
Daniel Yuh Chao · The Computer Journal · 2001
Unlike traditional classification by output conditions of places, synchronized choice nets were defined as a new class of nets characterized by local structures. This paper investigates its liveness. The time required to examine local structures is less than that required to examine global structures (via structure objects). Thus polynomial time algorithms can be developed to verify the liveness property of Petri nets.