An approach to supervisory design for a class of controlled Petri nets

The paper deals with the design of a supervisor for a particular class of controlled Petri nets (CPNs): the “regular Petri nets”, i.e. The Petri net (PN) which generate a regular language. Following the general idea from Ushio (1989), where it was suggested for free-labeled PNs to develop the design procedure in the contest of automata theory, the approach proposed here is based on: the construction of an automaton linguistically equivalent to the given PN, the use of a design procedure as proposed by Ramadge and Wonham (1987), and the transfer of the design procedure on PN. This gives, for the class of regular CPNs, an algorithmic procedure for the design of the controller. This paper also presents a study for solving the problem of supervisory control design when the control specification is given by a regular expression and the PN is a general deterministic labeled PN