In: Ottmann, T.(Ed.): Lecture Notes in Computer Science, Vol. 267: Automata, Languages and Programming, pages 499-508. Springer-Verlag, 1987.
Abstract: The aim of this work is to draw the fundamental concepts used for the construction of the coverability tree of a Petri net. Then the author defines the general structure allowing the analysis of a transition system by reducing the number of states thanks to a coverability tree.