A Symbolic Approach to the Supervision of State Tree Structures
Chuan Ma, Walter Murray Wonham · 2005
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