Abstract
The authors address the supervisory synthesis problem of controlling the sequential behaviors of discrete-event dynamical systems (DEDSs) under complete and partial information through the use of synchronous composition of the plants and the supervisors. The authors present the notion of complete languages, discuss some of its algebraic properties, and show its close relation to omega -languages. The authors prove that the supremal (closed) complete and controllable sublanguage of a given language exists, and present an algorithm to compute it. They present a closed-form expression for the supremal omega -controllable sublanguage of a given omega -language in terms of the supremal (closed) complete and controllable sublanguage. This closed-form expression suggests that certain operations on a given omega -language can alternatively be achieved by performing certain other similar operations on its prefix (which is a finite language) and then taking the limit (to obtain the desired omega -language). A necessary and sufficient condition for the existence of a supervisor in case of partial observation is presented in terms of omega -observability. Notion of omega -normality is also introduced, and a closed-form expression for the supremal omega -normal sublanguage, in terms of the supremal closed, complete, and normal sublanguage, is presented. >
Sign-in/Register to access full text options 
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.
