- Introduces AMSs with focus on their deadlock control issues
- Discusses the basic concepts and definitions of Petri nets, including siphons, P-invariants, state equations, reachable sets, and reachability graphs
- Formulates symbolic computation and analysis methods of bounded Petri nets, by using BDDs which are capable of representing large sets of markings with small data structures
- Presents a deadlock prevention strategy by using the theory of regions
- Considers the design of a maximally permissive liveness-enforcing supervisor for manufacturing-oriented Petri net models existing in the literature
- Examines the design of a maximally permissive liveness enforcing supervisor with a compact supervisory structure by minimizing the number of monitors
- Supplies a well trade-off among the three criteria: behavioral permissiveness, structural complexity, and computational complexity
This monograph presents the state-of-the-art developments in the design of behaviorally and structurally optimal livenessen-forcing Petri net supervisors with computationally tractable approaches. It details optimal supervisory control problems arising in automated production systems and outlines a methodology to achieve the optimality purposes of deadlock prevention via converting a variety of problems under consideration into integer linear programming models. The book includes a reference bibliography at the end of each chapter and a complete index.
Table of Contents
Introduction. Preliminaries. Symbolic Computation and Analysis of Petri Nets. Supervisor Design Based on the Theory of Regions. Maximally Permissive Supervisors. Most Permissive Supervisors. Structurally Minimal Supervisors. Behaviorally Optimal and Structurally Simple Supervisors. Forbidden State Problems. Conclusions and Open Problems.