Abstract
This paper investigates the use of sets of places of a Petri net as additional (to input places) constraints for granting concession to a transition.
Various modes of using constraints give rise to various classes (of languages) of constrained Petri nets. The power of these classes is compared in the language theoretical framework.
Get full access to this article
View all access options for this article.