zbMATH — the first resource for mathematics

Constrained Petri nets. II. Generalizations and extensions. (English) Zbl 0582.68031
This paper continues the investigation of the authors [reviewed above, see Zbl 0582.68030] concerning the use of sets of places of a Petri net as additional (to input places) constraints for granting a concession. New interpretations of more general constraints are considered and expressed as Boolean expressions. This gives rise to various classes of constrained Petri nets. These are compared in the language-theoretical framework introduced by the authors [loc. cit.]. An upper bound for the language defining power is found in the class of context-free programmed languages.

68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)