An approach to determine controllability of monolithic supervisors

In this paper we study the problem of supervisory design using Petri nets. We consider a monolithic supervisor candidate, i.e., a net obtained by concurrent composition of plant and specification, and we say that the control problem has an OR-AND GMEC solution if the set of the legal markings of such a net can be described by a disjunction/conjunctions of linear constraints. We derive some sufficient conditions, based on the boundedness of some places of the net, for the existence of such a solution.