Presents strategies with reachability graph analysis for optimizing resource allocation systems
Supervisory Control and Scheduling of Resource Allocation Systems offers an important guide to Petri net (PN) models and methods for supervisory control and system scheduling of resource allocation systems (RASs). Resource allocation systems are common in automated manufacturing systems, project management systems, cloud data centers, and software engineering systems. The authors–two experts on the topic–present a definition, techniques, models, and state-of-the art applications of supervisory control and scheduling problems.
The book introduces the basic concepts and research background on resource allocation systems and Petri nets. The authors then focus on the deadlock-free supervisor synthesis for RASs using Petri nets. The book also investigates the heuristic scheduling of RASs based on timed Petri nets. Conclusions and open problems are provided in the last section of the book.
This important book:
* Includes multiple methods for supervisory control and scheduling with reachability graphs, and provides illustrative examples
* Reveals how to accelerate the supervisory controller design and system scheduling of RASs based on PN reachability graphs, with optimal or near-optimal results
* Highlights both solution quality and computational speed in RAS deadlock handling and system scheduling
Written for researchers, engineers, scientists, and professionals in system planning and control, engineering, operation, and management, Supervisory Control and Scheduling of Resource Allocation Systems provides an essential guide to the supervisory control and scheduling of resource allocation systems (RASs) using Petri net reachability graphs, which allow for multiple resource acquisitions and exible routings.
Spis treści
Preface xi
Acknowledgments xv
Glossary xvii
Acronyms xxiii
PART I RESOURCE ALLOCATION SYSTEMS AND PETRI NET
1 Introduction 3
2 Preliminaries 9
PART II SUPERVISORY CONTROL
3 Behaviorally Maximal and Structurally Minimal Supervisor 37
4 Supervisor Design with Fewer Places 51
5 Redundant Constraints Elimination 67
6 Fast Iterative Supervisory Design 83
7 Supervisor Synthesis with Uncontrollable and Unobservable Transitions 101
PART III HEURISTIC SCHEDULING
8 Informed Heuristic Search in Reachability Graph 121
9 Controllable Heuristic Search 137
10 Hybrid Heuristic Search 157
11 More Informed Heuristics 167
12 Symbolic Heuristic Search 177
13 Open Problems 197
Bibliography 203
Index 217
O autorze
BO HUANG, PHD, is a Full Professor with the School of Computer Science and Engineering at Nanjing University of Science and Technology (NUST).
MENGCHU ZHOU, PHD, is a Distinguished Professor of Electrical and Computer Engineering and the Director of Discrete-Event Systems Laboratory at the New Jersey Institute of Technology (NJIT).