In: Electron. Commun. Jpn. 1, Commun. (USA) Vol. 71, No. 6, pages 33-44. 1988.
Abstract: T-invariants of a Petri net are studied 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.