Abstract
Discrete-event systems are studied, treating the state space as the fundamental modeling concept. The control of discrete-event systems using predicates and predicate transformers is treated. Predicates have the advantage that they can concisely characterize an infinite state space. The notion of controllability of a predicate is defined, and the supervisory predicate control problem is solved. A closed-form expression for the weakest controllable predicate is obtained. The problem of controlling discrete event systems under incomplete state observation is also considered, and observability of predicates is defined. Techniques for finding extremal solutions of Boolean equations are used to derive minimally restrictive supervisors.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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.
