Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Representation of supervisory controls using state tree structures, binary decision diagrams, automata, and supervisor reduction

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

4 Author(s)
Wujie Chao ; Sch. of Electr. Eng., Xi''an Jiaotong Univ., Xi''an, China ; Yongmei Gan ; Zhaoan Wang ; Wonham, W.M.

In the synthesis of an optimal nonblocking supervisor for a discrete-event system (DES), the problem of state explosion is a well-known computational obstacle. This problem can often be managed successfully by the use of state-tree structures (STS) and binary decision diagrams (BDD). Unfortunately BDD control functions may become quite large, and as such difficult to represent and interpret. In some cases it may, therefore, be convenient to convert an STS/BDD based controller to automaton form, and then apply a well known algorithm for supervisor reduction. In this paper we illustrate the advantage of this approach with a concrete example.

Published in:

Control and Decision Conference (CCDC), 2012 24th Chinese

Date of Conference:

23-25 May 2012