Universite de Paris-Sud, Laboratoire de Recherche en Informatique, Rapport de Recherche No. 365, August 1987.
Abstract: A structure for transistion systems is presented such that main algorithms on Petri nets can be generalized to well structured transition systems. The reduced reachability tree and the coverability graph are defined and the procedure of Karp and Miller is extended. It turns out that quasi-liveness, the total deadlock problem, and the boundedness problem are decidable.
Back to the Petri Nets Bibliography