In: IEEE Transactions on Automatic Control, Vol. 35, No. 4, pages 482-485. April 1990.
Abstract: Various classes of Petri net languages are compared. A constructive proof of the equivalence, from the point of view of descriptive power of general Petri nets and restricted Petri nets (no multiple arcs of self-loops are allowed in the latter class), is presented. The descriptive power of Petri nets versus that of finitely recursive processes is discussed.
Keywords: net language; restricted net; net equivalence.