DocumentCode :
3113837
Title :
Efficient Analysis of Large Discrete-Event Systems with Binary Decision Diagrams
Author :
Vahidi, Arash ; Lennartson, Bengt ; Fabian, Martin
Author_Institution :
Department of Signals and Systems, Chalmers University of Technology SE-412 96 Göteborg, Sweden vahidi@s2.chalmers.se
fYear :
2005
fDate :
12-15 Dec. 2005
Firstpage :
2751
Lastpage :
2756
Abstract :
Efficient analysis and controller synthesis in the context of Discrete-Event Systems (DES) is discussed in this paper. We consider efficient reachability search for solving common problems in the Supervisory Control Theory (SCT). The search is based on symbolic computations including crucial partitioning techniques. Finally, the efficiency of the presented algorithms is demonstrated on a set of hand-made and real-world industrial systems.
Keywords :
Discrete-event systems; reachability search; supervisory control; symbolic computation; Automata; Automatic control; Boolean functions; Control system analysis; Control system synthesis; Data structures; Discrete event systems; Electrical equipment industry; Partitioning algorithms; Supervisory control; Discrete-event systems; reachability search; supervisory control; symbolic computation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Decision and Control, 2005 and 2005 European Control Conference. CDC-ECC '05. 44th IEEE Conference on
Print_ISBN :
0-7803-9567-0
Type :
conf
DOI :
10.1109/CDC.2005.1582579
Filename :
1582579
Link To Document :
بازگشت