In: Rozenberg, G.: Lecture Notes in Computer Science, Vol. 340: Advances in Petri Nets 1988, pages 266-282. Springer-Verlag, 1988.
Abstract: The aim of this artictle is to explain and elucidate Mayr's and Kosaraju's proof of the decidability of reachability in Petri nets. A new structure on Petri nets is obtained: the perfect marked graph-transition sequences wich generalises, in the case a final marking is added to the Petri net, the covering graph. From this structure new results in Petri net language theory are deduced.