Structural analysis of t‐invariance of petri nets
Kenji Onaga, Qi‐Wei Ge · Electronics and Communications in Japan (Part I Communications) · 1988
Abstract This paper studies the t‐invariance of a Petri net by introducing two concepts of the rigidity for its existence and the marked‐graph‐reducibility for its efficient computation. Some characteristics and composition rules of rigidly connected Petri nets are given and an algorithm is designed to determine efficiently t‐invariants of a marked‐graph‐reducible Petri net.