Representation of Supervisory Controls using State Tree Structures, Binary Decision Diagrams, Automata, and Supervisor Reduction
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 dif.cult 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.
Discrete event systems supervisory control state tree structures binary decision diagrams automata supervisor reduction
Wujie Chao Yongmei Gan Zhaoan Wang W. M. Wonham
School of Electrical Engineering, Xian Jiaotong University, Xian, China, 710049 Department of Electrical and Computer Engineering, University of Toronto, ON, M5S 3G4, Canada.
国际会议
The 24th Chinese Control and Decision Conference (第24届中国控制与决策学术年会 2012 CCDC)
太原
英文
45-50
2012-05-23(万方平台首次上网日期,不代表论文的发表时间)