Nonblocking supervisory control of state tree structures. (Q2571140)

The central theoretical contribution of this book can be summarized as: a formalized State Tree Structures (STS) model, the symbolic synthesis of its optimal nonblocking supervisor, and a neat control implementation. Any optimal nonblocking supervisory control problem posed in the original RW framework can be treated in STS framework without any restriction; and the STS framework is readily adaptable to structured complex systems having state size more than \(10^{20}\). The book is organized as follows: \(\bullet\) In chapter 2, a formalized STS model is developed. Several important concepts are introduced. Among them are -state tree that assigns structure to the state space, -sub-state-tree that plays the same role as state in an automaton, -holon that defines the local transition graph. \(\bullet\) In chapter 3, a new approach to optimal nonblocking supervisory control design is obtained. An innovation in the setting is that reachability does not play as significant a role. \(\bullet\) Chapter 4 is the core of the book. Here the authors demonstrate the symbolic representation and synthesis of STS. First, the control problem for STS is formulated. Second, by introducing the recursive function \(\widehat\Gamma\), the hierarchical state space and transition structures can be easily encoded. Third, by taking advantage of the rich structure of STS model, the algorithm given in chapter 3 is adapted to a recursive symbolic algorithm. \(\bullet\) Chapter 5 explains how to model and control a benchmark example, the Production Cell, using the STS methodology. The most important advantage of STS demonstrated here is that it can provide users with an integrated view of the control problem. \(\bullet\) In chapter 6 another case study is presented, the AIP. This example also demonstrates the modelling and synthesis power of the STS framework. \(\bullet\) Finally, chapter 7 presents conclusions and some future research directions. An intuitive discussion of computational complexity is also presented here.