By Topic

Supervisory control of discrete event systems with CTL* temporal logic specifications

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

2 Author(s)
Shengbing Jiang ; Dept. of Electr. & Comput. Eng., Kentucky Univ., Lexington, KY, USA ; Kumar, R.

A supervisory control problem of discrete event systems with temporal logic specifications is studied. The full branching time logic, CTL*, is used for expressing specifications of discrete event systems. The control problem of CTL* is reduced to the decision problem of CTL*. A small model theorem for the control of CTL* is obtained. It is shown that the control problem of CTL* (resp., CTL) is complete for deterministic double (resp., single) exponential time. A sound and complete supervisor synthesis algorithm for the control of CTL* is provided. Special cases of the control of computation tree logic (CTL) and linear-time temporal logic (LTL) are also studied. The main contributions of the paper are summarized as follows: (i) For the first time a sound and complete supervisory synthesis algorithm for CTL specifications has been obtained; (ii) Usage of temporal logic makes the specification specifying process easier and user-friendly since natural language specifications can be easily translated to temporal logic specifications and at the same time there is no increase in the computational complexity ; (iii) CTL* temporal logic allows the control constraints on the sequences of states which can be also captured by a regular *-language or ω-language, as well as on the more general branching structures of states which can not be captured by a regular *-language or ω-language

Published in:

Decision and Control, 2001. Proceedings of the 40th IEEE Conference on  (Volume:5 )

Date of Conference:

2001