A Symbolic Approach to the Supervision of State Tree Structures

Author

Ma, Chuan ; Wonham, W.M.

Author_Institution

Dept. of Electr. & Comput. Eng., Toronto Univ., Ont.

fYear

2005

fDate

27-29 June 2005

Firstpage

908

Lastpage

913

Abstract

It is well known that the nonblocking supervisory control problem is NP-hard, subject in particular to combinatorial state explosion that is exponential in the number of system components. To manage this complexity we introduce state tree structures (STS), an adaptation of statecharts to the supervisory control theory. The systems to be controlled are modeled as STS hierarchies encoded by binary decision diagrams. This approach is capable of dealing with discrete-event systems of industrial size; furthermore the controllers are highly structured and comprehensible to non-specialists

Keywords

SCADA systems; binary decision diagrams; computational complexity; control system synthesis; discrete event systems; symbol manipulation; trees (mathematics); NP-hard problem; binary decision diagrams; combinatorial state explosion; complexity management; discrete-event systems; nonblocking supervisory control; state tree structure supervision; statecharts; supervisory control theory; symbolic computation; Boolean functions; Control system synthesis; Data structures; Discrete event systems; Electrical equipment industry; Explosions; Industrial control; Sociotechnical systems; Supervisory control; Tree data structures;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Control, 2005. Proceedings of the 2005 IEEE International Symposium on, Mediterrean Conference on Control and Automation

Conference_Location

Limassol

ISSN

2158-9860

Print_ISBN

0-7803-8936-0

Type

conf

DOI

10.1109/.2005.1467135

Filename

1467135