Abstract
In discrete-event systems, two control techniques, called supervisory control and state feedback logic, are applicable if control specifications are given in terms of predicates on the set of states. The concepts of controllability for both techniques has been proposed for the analysis and design of these techniques. First it is shown that controllability of the legal language for a given predicate is equivalent to that for the corresponding reachability set. Next we deal with the relationship between the supremal controllable subpredicate of the predicate and the supremal controllable sublanguage of the corresponding legal language
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.
