Title :
Nonblocking supervisory control of state tree structures
Author :
Ma, Chuan ; Wonham, W.M.
Author_Institution :
Syst. Control Group, Univ. of Toronto, Ont., Canada
fDate :
5/1/2006 12:00:00 AM
Abstract :
It is well known that the nonblocking supervisory control problem is NP-hard, subject in particular to state space explosion that is exponential in the number of system components. In this paper we propose to manage complexity by organizing the system as a state tree structure (STS). STS are an adaptation of statecharts to supervisory control theory. Based on STS we present an efficient recursive symbolic algorithm that can perform nonblocking supervisory control design (in reasonable time and memory) for systems of state size 1024 and higher. The resulting controllers are tractable and readily comprehensible.
Keywords :
computational complexity; control system synthesis; discrete event systems; state-space methods; NP-hard problem; nonblocking supervisory control; recursive symbolic algorithm; state space explosion; state tree structures; statecharts; Algorithm design and analysis; Automata; Binary decision diagrams; Control system synthesis; Explosions; Organizing; Sociotechnical systems; State-space methods; Supervisory control; Tree data structures; Discrete-event system; nonblocking supervisory control; state tree structure (STS); symbolic computation;
Journal_Title :
Automatic Control, IEEE Transactions on
DOI :
10.1109/TAC.2006.875030
