Towards a hierarchy of nets (Q1058855)

The paper considers the following classes of (extended) Petri nets: Petri nets P (place/transition nets without multiple arcs and without capacities), inhibitor nets I, labelled Petri nets LP (Petri nets with a homomorphism from transition sequences to label sequences), labelled inhibitor nets LI and log-nets L (Petri nets with two sorts of arcs enabling a transition iff all input places of the first sort carry a token and at least one input place of the second sort carrys a token). Let \(X\to Y\) abbreviate ''the class of X-languages is strictly included in the class of Y-languages''. By comparing the associated net languages simplified proofs for \(P\to I\to LI\), \(P\to LP\to LI\), \(P\to L\to LI\) and ''I incomparable to LP'' are given. ''I incomparable to L'' is a new result. Labelled log-nets are not considered and no comparison of L and LP is made.