Abstract
In this paper, we investigate stability-enforcing supervisory control of nondeterministic discrete event systems (DESs) from a brand-new angle. First, the dynamics of a discrete event system (DES) are converted into an algebraic equation in the framework of Boolean semi-tensor product. Using it, several necessary and sufficient conditions are presented to verify whether a DES is stable or not. Second, effective verification criteria are provided for the stabilization problem of DESs. Further, a cost function of disabling controllable events at corresponding states is defined. A matrix-based methodology of finding all minimally restrictive optimal stability-enforcing supervisors is presented. Finally, two examples are provided to illustrate the theoretical results.
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.
