Supervisory control of Petri net languages

The authors study the supervisory control problem in the setting of Petri net languages. They show that the problem of determining controllability for Petri net languages is reducible to the reachability problem of Petri nets. They also show that the problem of synthesizing the maximally permissive supervisor so that the closed system generates the supremal controllable sublanguage is reducible to a forbidden marking problem. In particular, one can directly identify the set of forbidden markings without having to construct the reachability tree. A method for generating the supremal controllable sublanguage is developed using this reduction