Restricting the in-out Structure of Graphs of Petri Nets

Abstract

Petri nets are classified according to the restrictions on the possible in-out structure of nodes of the underlying graphs. Such a classification is investigated separately for the structure of transitions and the structure of places. The classification is done from the language theoretical point of view, i.e. behaviour of a net is expressed by the language it generates. Two approaches are used. Firstly, various classes of nets are compared with respect to the languages of firing sequences they generate. Secondly, the comparison results so obtained are sharpened (often quite drastically) by looking at nets as generators of the so-called subset languages.