Nonblocking supervisory control of state tree structures.
Published: 2004
Language: eng
Number of pages: 235
Description: It is well known that the optimal 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 thesis, 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 (SCT). 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 1020 and higher. The resulting controllers are tractable and highly comprehensible.
Notes: Adviser:  W. M. Wonham.

Thesis (Ph.D.)--University of Toronto, 2004.

Electronic version licensed for access by U. of T. users.

Source: Dissertation Abstracts International, Volume: 65-05, Section: B, page: 2479.