Abstract
In this paper, we formalize and solve a state-based Supervisory Control problem with restrictions on the supervisor realization that have not been tackled by the Supervisory Control Theory (SCT) community so far. This problem was derived from the application of SCT to intervene in the dynamics of gene regulatory networks, a relevant problem in the fields of Systems and Synthetic Biology. In our framework, a plant, whose states x are represented by Boolean strings, must be driven from an initial state to a target one, by means of m state-feedback control laws ui = hi(x). The Boolean functions hi, though, cannot be freely chosen, but must rather belong to a (possibly strict) subset R of all the Boolean functions on x.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
