Nonblocking Supervisory Control of State Tree Structures
The work
| Authors | Chuan Ma; Walter Murray Wonham |
|---|---|
| Editors | |
| Type | article |
| Year | 2006 |
| Citekey | ma2006nonblocking |
Where it appeared
| Published in | IEEE Transactions on Automatic Control |
|---|---|
| Publisher | Institute of Electrical and Electronics Engineers |
| Volume | 51 |
| Issue | 5 |
| Pages | 782--793 |
Identifiers
| DOI | 10.1109/tac.2006.875030 |
|---|---|
| OpenAlex | W2115425820 |
Access
| Landing page | https://doi.org/10.1109/tac.2006.875030 |
|---|
From OpenAlex, which stores abstracts as an index of words and their positions: what is shown is rebuilt from that, and reads fluently whether or not it is what the author wrote.
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 10/sup 24/ and higher. The resulting controllers are tractable and readily comprehensible.
How it got here
| How it got here | agent via openalex |
|---|---|
| Added | 2026-10-27 01:31 UTC |
| Not denied by | a person 2026-10-29 17:12 UTC |
Cite it as
@article{ma2006nonblocking,
title = {Nonblocking Supervisory Control of State Tree Structures},
author = {Chuan Ma and Walter Murray Wonham},
year = {2006},
journal = {IEEE Transactions on Automatic Control},
publisher = {Institute of Electrical and Electronics Engineers},
volume = {51},
number = {5},
pages = {782--793},
doi = {10.1109/tac.2006.875030},
}
This record lives at https://refs.drheap.org/ma2006nonblocking/ and will keep doing so.