Some results on Petri net languages

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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>