Nonblocking supervisory control of state tree structures


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… (More)
DOI: 10.1109/TAC.2006.875030

15 Figures and Tables



Citations per Year

149 Citations

Semantic Scholar estimates that this publication has 149 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics