By Topic

Predicates and predicate transformers for supervisory control of discrete event dynamical systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kumar, R. ; Dept. of Electr. Eng., Kentucky Univ., Lexington, KY, USA ; Garg, V. ; Marcus, S.I.

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

Published in:

Automatic Control, IEEE Transactions on  (Volume:38 ,  Issue: 2 )