The controllability and supremal controllable sublanguage of Petri net languages

In this paper we discuss the controllability problem of Petri net languages and obtain the necessary and sufficient condition for it. Then we present a method for synthesizing a feedback controller by which the closed loop system generates the supremal controllable sublanguage of a given Petri net language, and two examples are given for illustration.<
>