In: Lecture Notes in Computer Science, Vol. 380: Fundamentals of Computation Theory, Proc. of the Int. Conf. FCT'89, pages 234-243. Springer-Verlag, 1989.
Also as: Technical Report 89--2. Ames, Iowa: State University, Department of Computer Science,, February 1989.
Abstract: The authors examine both the modeling power of normal and sinkless Petri nets and the computational complexities of various classical decision problems with respect to these two classes. They argue that although neither normal nor sinkless Petri nets are strictly more powerful than persistent Petri nets, the nonetheless are both capable of modeling a more interesting class of problems. The authors give strong evidence that normal and sinkless Petri nets are easier to analyze than persistent Petri nets.