http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
Supervisory control and scheduling of resource allocation systems
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.
Cover -- Title Page -- Copyright Page -- Contents -- Preface -- Acknowledgments -- Glossary -- Acronyms -- About the Authors -- Part I Resource Allocation Systems and Petri Nets -- Chapter 1 Introduction -- 1.1 Resource Allocation Systems -- 1.2 Supervisory Control and Scheduling with Petri Nets -- 1.3 Summary -- 1.4 Bibliographical Notes -- Chapter 2 Preliminaries -- 2.1 Introduction -- 2.2 Petri Nets -- 2.2.1 Basic Concepts -- 2.2.2 Modeling Power of Petri Nets -- 2.2.2.1 Sequential Execution -- 2.2.2.2 Concurrency (Parallelism) -- 2.2.2.3 Synchronization -- 2.2.2.4 Conflict (choice)
2.2.2.5 Merging -- 2.2.2.6 Mutual Exclusion -- 2.2.3 Behavioral Properties of Petri Nets -- 2.2.3.1 Boundedness and Safeness -- 2.2.3.2 Liveness and Deadlock -- 2.2.3.3 Reversibility -- 2.2.3.4 Conservativeness -- 2.2.4 Subclasses of Petri Nets -- 2.2.4.1 Ordinary Nets and Generalized Nets -- 2.2.4.2 Pure Petri Nets -- 2.2.4.3 State Machines -- 2.2.4.4 Marked Graphs -- 2.2.4.5 Free-choice Nets -- 2.2.4.6 Extended Free-choice Nets -- 2.2.4.7 Asymmetric Choice Nets -- 2.2.5 Petri Nets for Resource Allocation Systems -- 2.2.5.1 PC2R -- 2.2.5.2 S*PR -- 2.2.5.3 S5PR
2.2.5.4 S4PR, S4R, S3 PGR2 and WS3 PSR -- 2.2.5.5 S3PR -- 2.2.5.6 ES3PR and S3PMR -- 2.2.5.7 LS3PR -- 2.2.5.8 ELS3PR -- 2.2.5.9 GLS3PR -- 2.2.6 Structural Analysis -- 2.2.7 Reachability Graph Analysis -- 2.2.7.1 Supervisory Control -- 2.2.7.2 System Scheduling -- 2.2.8 Petri Net Analysis Tools -- 2.3 Informed Heuristic Search -- 2.3.1 Basic Concepts of Heuristic A* Search -- 2.3.2 Properties of the A* Search -- 2.3.2.1 Completeness -- 2.3.2.2 Admissible Heuristics -- 2.3.2.3 Monotone (Consistent) Heuristics -- 2.3.2.4 More Informed Heuristics -- 2.4 Bibliographical Notes
Part II Supervisory Control -- Chapter 3 Behaviorally Maximal and Structurally Minimal Supervisor -- 3.1 Introduction -- 3.2 Petri Nets for Supervisory Synthesis -- 3.3 Optimal and Minimal Supervisory Synthesis -- 3.3.1 Reachability Graph Analysis -- 3.3.2 Supervisor Computation with Place Invariants -- 3.3.3 Optimal Supervisor Synthesis and Vector Covering Method -- 3.3.4 Optimal Supervisor with Fewest Monitors -- 3.3.5 Deadlock Prevention Policy -- 3.4 An Illustrative Example -- 3.5 Concluding Remarks -- 3.6 Bibliographical Notes -- Chapter 4 Supervisor Design with Fewer Places
4.1 Introduction -- 4.2 Critical and Free Activity Places -- 4.3 Properties of DP-Nets -- 4.4 Supervisor Design with Critical Activity Places -- 4.5 An Illustrative Example -- 4.6 Concluding Remarks -- 4.7 Bibliographical Notes -- Chapter 5 Redundant Constraint Elimination -- 5.1 Introduction -- 5.2 Minimal-Number-of-Monitors Problem -- 5.3 Elimination of Redundant Constraints -- 5.3.1 Redundant Reachability Constraints -- 5.3.2 Linear Program Method -- 5.3.3 Non-Linear Program Method -- 5.3.4 Supervisor Synthesis with Redundancy Elimination -- 5.4 Illustrative Examples -- 5.5 Concluding Remarks
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
Includes bibliographical references and index.
Supervisory Control and Scheduling of Resource Allocation Systems : Reachability Graph Perspective
Newark : John Wiley & Sons, Incorporated,c2020
IEEE Press Series on Systems Science and Engineering Ser