Using predicate transformers for supervisory control
- 9 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 98-103 vol.1
- https://doi.org/10.1109/cdc.1991.261263
Abstract
A methodology is outlined for designing controllers for a wide variety of systems described in terms of a set of predicate transformers. 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 introduced 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 the extremal solution of Boolean equations are used to derive minimally restrictive supervisors.<>Keywords
This publication has 10 references indexed in Scilit:
- Controlling behaviours of systems : Some basic concepts and some applicationsPublished by Springer Nature ,2005
- Dynamical logic observers for finite automataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Predicates and predicate transformers for supervisory control of discrete event dynamical systemsIEEE Transactions on Automatic Control, 1993
- On supervisory control of sequential behaviorsIEEE Transactions on Automatic Control, 1992
- On controllability and normality of discrete event dynamical systemsSystems & Control Letters, 1991
- Formulas for calculating supremal controllable and normal sublanguagesSystems & Control Letters, 1990
- Refinement and projection of relational specificationsPublished by Springer Nature ,1990
- Predicate Calculus and Program SemanticsPublished by Springer Nature ,1990
- Modular Feedback Logic for Discrete Event SystemsSIAM Journal on Control and Optimization, 1987
- Supervisory Control of a Class of Discrete Event ProcessesSIAM Journal on Control and Optimization, 1987