{"product_id":"supervisory-control-and-scheduling-of-resource-allocation-systems-9781119619680","title":"Supervisory Control and Scheduling of Resource","description":"\u003cb\u003eBook Synopsis\u003c\/b\u003e\u003cbr\u003e\u003cp\u003e\u003cb\u003ePresents strategies with reachability graph analysis for optimizing resource allocation systems\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003ci\u003eSupervisory Control and Scheduling of Resource Allocation Systems\u003c\/i\u003e 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 authorstwo experts on the topicpresent a definition, techniques, models, and state-of-the art applications of supervisory control and scheduling problems.\u003c\/p\u003e \u003cp\u003eThe 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\u003cbr\u003e\u003cbr\u003e\u003cb\u003eTable of Contents\u003c\/b\u003e\u003cbr\u003e\u003c\/p\u003e\u003cp\u003ePreface xi\u003c\/p\u003e \u003cp\u003eAcknowledgments xvii\u003c\/p\u003e \u003cp\u003eGlossary xix\u003c\/p\u003e \u003cp\u003eAcronyms xxiii\u003c\/p\u003e \u003cp\u003eAbout the Authors xxv\u003c\/p\u003e \u003cp\u003e\u003cb\u003ePart I Resource Allocation Systems and Petri Nets \u003c\/b\u003e\u003cb\u003e1\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003e1 Introduction \u003c\/b\u003e\u003cb\u003e3\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e1.1 Resource Allocation Systems 3\u003c\/p\u003e \u003cp\u003e1.2 Supervisory Control and Scheduling with Petri Nets 7\u003c\/p\u003e \u003cp\u003e1.3 Summary 9\u003c\/p\u003e \u003cp\u003e1.4 Bibliographical Notes 9\u003c\/p\u003e \u003cp\u003e\u003cb\u003e2 Preliminaries \u003c\/b\u003e\u003cb\u003e11\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e2.1 Introduction 11\u003c\/p\u003e \u003cp\u003e2.2 Petri Nets 12\u003c\/p\u003e \u003cp\u003e2.2.1 Basic Concepts 12\u003c\/p\u003e \u003cp\u003e2.2.2 Modeling Power of Petri Nets 16\u003c\/p\u003e \u003cp\u003e2.2.2.1 Sequential Execution 16\u003c\/p\u003e \u003cp\u003e2.2.2.2 Concurrency (Parallelism) 17\u003c\/p\u003e \u003cp\u003e2.2.2.3 Synchronization 17\u003c\/p\u003e \u003cp\u003e2.2.2.4 Conflict (choice) 17\u003c\/p\u003e \u003cp\u003e2.2.2.5 Merging 17\u003c\/p\u003e \u003cp\u003e2.2.2.6 Mutual Exclusion 18\u003c\/p\u003e \u003cp\u003e2.2.3 Behavioral Properties of Petri Nets 18\u003c\/p\u003e \u003cp\u003e2.2.3.1 Boundedness and Safeness 18\u003c\/p\u003e \u003cp\u003e2.2.3.2 Liveness and Deadlock 19\u003c\/p\u003e \u003cp\u003e2.2.3.3 Reversibility 19\u003c\/p\u003e \u003cp\u003e2.2.3.4 Conservativeness 19\u003c\/p\u003e \u003cp\u003e2.2.4 Subclasses of Petri Nets 20\u003c\/p\u003e \u003cp\u003e2.2.4.1 Ordinary Nets and Generalized Nets 20\u003c\/p\u003e \u003cp\u003e2.2.4.2 Pure Petri Nets 20\u003c\/p\u003e \u003cp\u003e2.2.4.3 State Machines 21\u003c\/p\u003e \u003cp\u003e2.2.4.4 Marked Graphs 22\u003c\/p\u003e \u003cp\u003e2.2.4.5 Free-choice Nets 22\u003c\/p\u003e \u003cp\u003e2.2.4.6 Extended Free-choice Nets 22\u003c\/p\u003e \u003cp\u003e2.2.4.7 Asymmetric Choice Nets 22\u003c\/p\u003e \u003cp\u003e2.2.5 Petri Nets for Resource Allocation Systems 22\u003c\/p\u003e \u003cp\u003e2.2.5.1 PC\u003csup\u003e2\u003c\/sup\u003eR 23\u003c\/p\u003e \u003cp\u003e2.2.5.2 S*PR 24\u003c\/p\u003e \u003cp\u003e2.2.5.3 S\u003csup\u003e5\u003c\/sup\u003ePR 25\u003c\/p\u003e \u003cp\u003e2.2.5.4 S\u003csup\u003e4\u003c\/sup\u003ePR, S\u003csup\u003e4\u003c\/sup\u003eR, S\u003csup\u003e3\u003c\/sup\u003e PGR\u003csup\u003e2\u003c\/sup\u003e and WS\u003csup\u003e3\u003c\/sup\u003e PSR 25\u003c\/p\u003e \u003cp\u003e2.2.5.5 S\u003csup\u003e3\u003c\/sup\u003ePR 26\u003c\/p\u003e \u003cp\u003e2.2.5.6 ES\u003csup\u003e3\u003c\/sup\u003ePR and S\u003csup\u003e3\u003c\/sup\u003ePMR 26\u003c\/p\u003e \u003cp\u003e2.2.5.7 LS\u003csup\u003e3\u003c\/sup\u003ePR 27\u003c\/p\u003e \u003cp\u003e2.2.5.8 ELS\u003csup\u003e3\u003c\/sup\u003ePR 27\u003c\/p\u003e \u003cp\u003e2.2.5.9 GLS\u003csup\u003e3\u003c\/sup\u003ePR 28\u003c\/p\u003e \u003cp\u003e2.2.6 Structural Analysis 28\u003c\/p\u003e \u003cp\u003e2.2.7 Reachability Graph Analysis 30\u003c\/p\u003e \u003cp\u003e2.2.7.1 Supervisory Control 30\u003c\/p\u003e \u003cp\u003e2.2.7.2 System Scheduling 31\u003c\/p\u003e \u003cp\u003e2.2.8 Petri Net Analysis Tools 32\u003c\/p\u003e \u003cp\u003e2.3 Informed Heuristic Search 35\u003c\/p\u003e \u003cp\u003e2.3.1 Basic Concepts of Heuristic A* Search 35\u003c\/p\u003e \u003cp\u003e2.3.2 Properties of the A* Search 36\u003c\/p\u003e \u003cp\u003e2.3.2.1 Completeness 36\u003c\/p\u003e \u003cp\u003e2.3.2.2 Admissible Heuristics 36\u003c\/p\u003e \u003cp\u003e2.3.2.3 Monotone (Consistent) Heuristics 36\u003c\/p\u003e \u003cp\u003e2.3.2.4 More Informed Heuristics 36\u003c\/p\u003e \u003cp\u003e2.4 Bibliographical Notes 37\u003c\/p\u003e \u003cp\u003e\u003cb\u003ePart II Supervisory Control \u003c\/b\u003e\u003cb\u003e39\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003e3 Behaviorally Maximal and Structurally Minimal Supervisor \u003c\/b\u003e\u003cb\u003e41\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e3.1 Introduction 41\u003c\/p\u003e \u003cp\u003e3.2 Petri Nets for Supervisory Synthesis 43\u003c\/p\u003e \u003cp\u003e3.3 Optimal and Minimal Supervisory Synthesis 45\u003c\/p\u003e \u003cp\u003e3.3.1 Reachability Graph Analysis 45\u003c\/p\u003e \u003cp\u003e3.3.2 Supervisor Computation with Place Invariants 47\u003c\/p\u003e \u003cp\u003e3.3.3 Optimal Supervisor Synthesis and Vector Covering Method 47\u003c\/p\u003e \u003cp\u003e3.3.4 Optimal Supervisor with Fewest Monitors 49\u003c\/p\u003e \u003cp\u003e3.3.5 Deadlock Prevention Policy 50\u003c\/p\u003e \u003cp\u003e3.4 An Illustrative Example 52\u003c\/p\u003e \u003cp\u003e3.5 Concluding Remarks 54\u003c\/p\u003e \u003cp\u003e3.6 Bibliographical Notes 55\u003c\/p\u003e \u003cp\u003e\u003cb\u003e4 Supervisor Design with Fewer Places \u003c\/b\u003e\u003cb\u003e57\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e4.1 Introduction 57\u003c\/p\u003e \u003cp\u003e4.2 Critical and Free Activity Places 59\u003c\/p\u003e \u003cp\u003e4.3 Properties of DP-Nets 62\u003c\/p\u003e \u003cp\u003e4.4 Supervisor Design with Critical Activity Places 66\u003c\/p\u003e \u003cp\u003e4.5 An Illustrative Example 70\u003c\/p\u003e \u003cp\u003e4.6 Concluding Remarks 72\u003c\/p\u003e \u003cp\u003e4.7 Bibliographical Notes 73\u003c\/p\u003e \u003cp\u003e\u003cb\u003e5 Redundant Constraint Elimination \u003c\/b\u003e\u003cb\u003e75\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e5.1 Introduction 75\u003c\/p\u003e \u003cp\u003e5.2 Minimal-Number-of-Monitors Problem 77\u003c\/p\u003e \u003cp\u003e5.3 Elimination of Redundant Constraints 78\u003c\/p\u003e \u003cp\u003e5.3.1 Redundant Reachability Constraints 78\u003c\/p\u003e \u003cp\u003e5.3.2 Linear Program Method 79\u003c\/p\u003e \u003cp\u003e5.3.3 Non-Linear Program Method 82\u003c\/p\u003e \u003cp\u003e5.3.4 Supervisor Synthesis with Redundancy Elimination 84\u003c\/p\u003e \u003cp\u003e5.4 Illustrative Examples 85\u003c\/p\u003e \u003cp\u003e5.5 Concluding Remarks 91\u003c\/p\u003e \u003cp\u003e5.6 Bibliographical Notes 91\u003c\/p\u003e \u003cp\u003e\u003cb\u003e6 Fast Iterative Supervisor Design \u003c\/b\u003e\u003cb\u003e93\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e6.1 Introduction 93\u003c\/p\u003e \u003cp\u003e6.2 Optimal Supervisor of a DP-net 94\u003c\/p\u003e \u003cp\u003e6.3 Fast Synthesis of Optimal and Simple Supervisors 95\u003c\/p\u003e \u003cp\u003e6.3.1 Multiobjective Supervisory Control 96\u003c\/p\u003e \u003cp\u003e6.3.2 Design of an Optimal Control Place 97\u003c\/p\u003e \u003cp\u003e6.3.3 Identification of Redundant Constraints 99\u003c\/p\u003e \u003cp\u003e6.3.4 Iterative Deadlock Prevention 102\u003c\/p\u003e \u003cp\u003e6.4 Illustrative Examples 107\u003c\/p\u003e \u003cp\u003e6.5 Concluding Remarks 115\u003c\/p\u003e \u003cp\u003e6.6 Bibliographical Notes 115\u003c\/p\u003e \u003cp\u003e\u003cb\u003e7 Supervisor Synthesis with Uncontrollable and Unobservable Transitions \u003c\/b\u003e\u003cb\u003e117\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e7.1 Introduction 117\u003c\/p\u003e \u003cp\u003e7.2 Supervisor Synthesis with Uncontrollability and Unobservability 119\u003c\/p\u003e \u003cp\u003e7.2.1 DP-Nets with Uncontrollable and\/or Unobservable Transitions 119\u003c\/p\u003e \u003cp\u003e7.2.2 Admissible Markings and First-Met Inadmissible Markings 120\u003c\/p\u003e \u003cp\u003e7.2.3 Design of an Admissible Monitor 123\u003c\/p\u003e \u003cp\u003e7.2.4 Admissible and Structure-Minimal Supervisor Synthesis 125\u003c\/p\u003e \u003cp\u003e7.3 Deadlock Prevention Policy 127\u003c\/p\u003e \u003cp\u003e7.4 Illustrative Experiments 132\u003c\/p\u003e \u003cp\u003e7.5 Concluding Remarks 136\u003c\/p\u003e \u003cp\u003e7.6 Bibliographical Notes 136\u003c\/p\u003e \u003cp\u003e\u003cb\u003ePart III Heuristic Scheduling \u003c\/b\u003e\u003cb\u003e137\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003e8 Informed Heuristic Search in Reachability Graph \u003c\/b\u003e\u003cb\u003e139\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e8.1 Introduction 139\u003c\/p\u003e \u003cp\u003e8.2 System Scheduling with Place-Timed Petri Nets 140\u003c\/p\u003e \u003cp\u003e8.2.1 Place-Timed Petri Nets 140\u003c\/p\u003e \u003cp\u003e8.2.2 Conversion from an Untimed Petri Net 141\u003c\/p\u003e \u003cp\u003e8.2.3 Synthesis of a Place-Timed Petri Net 143\u003c\/p\u003e \u003cp\u003e8.2.3.1 Top-down Method 144\u003c\/p\u003e \u003cp\u003e8.2.3.2 Bottom-up Method 145\u003c\/p\u003e \u003cp\u003e8.3 State Evolution of Place-Timed Nets 145\u003c\/p\u003e \u003cp\u003e8.4 A* Search on a Reachability Graph 152\u003c\/p\u003e \u003cp\u003e8.5 A* Search with State Check 153\u003c\/p\u003e \u003cp\u003e8.6 An Illustrative Example 155\u003c\/p\u003e \u003cp\u003e8.7 Concluding Remarks 156\u003c\/p\u003e \u003cp\u003e8.8 Bibliographical Notes 156\u003c\/p\u003e \u003cp\u003e\u003cb\u003e9 Controllable Heuristic Search \u003c\/b\u003e\u003cb\u003e157\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e9.1 Introduction 157\u003c\/p\u003e \u003cp\u003e9.2 Alternative Routes with Different Lengths 159\u003c\/p\u003e \u003cp\u003e9.3 An Admissible Heuristic for SC-nets 160\u003c\/p\u003e \u003cp\u003e9.4 A Controllable Heuristic Search 163\u003c\/p\u003e \u003cp\u003e9.5 Randomly Generated Examples 166\u003c\/p\u003e \u003cp\u003e9.6 Another Controllable Heuristic Search 168\u003c\/p\u003e \u003cp\u003e9.6.1 A* Search and Depth-First Search 168\u003c\/p\u003e \u003cp\u003e9.6.2 Controllable Hybrid Heuristic Search 171\u003c\/p\u003e \u003cp\u003e9.7 Illustrative Results 176\u003c\/p\u003e \u003cp\u003e9.8 Concluding Remarks 178\u003c\/p\u003e \u003cp\u003e9.9 Bibliographical Notes 179\u003c\/p\u003e \u003cp\u003e\u003cb\u003e10 Hybrid Heuristic Search \u003c\/b\u003e\u003cb\u003e181\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e10.1 Introduction 181\u003c\/p\u003e \u003cp\u003e10.2 A*-BT Combinations 182\u003c\/p\u003e \u003cp\u003e10.3 Illustrative Examples 187\u003c\/p\u003e \u003cp\u003e10.4 Concluding Remarks 190\u003c\/p\u003e \u003cp\u003e10.5 Bibliographical Notes 191\u003c\/p\u003e \u003cp\u003e\u003cb\u003e11 A* Search with More Informed Heuristics Functions \u003c\/b\u003e\u003cb\u003e193\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e11.1 Introduction 193\u003c\/p\u003e \u003cp\u003e11.2 More Informed Heuristics in A* Search 194\u003c\/p\u003e \u003cp\u003e11.3 Combination of Admissible and Inadmissible Heuristics 195\u003c\/p\u003e \u003cp\u003e11.4 Illustrative Examples 197\u003c\/p\u003e \u003cp\u003e11.5 Concluding Remarks 203\u003c\/p\u003e \u003cp\u003e11.6 Bibliographical Notes 204\u003c\/p\u003e \u003cp\u003e\u003cb\u003e12 Symbolic Heuristic Search \u003c\/b\u003e\u003cb\u003e205\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e12.1 Introduction 205\u003c\/p\u003e \u003cp\u003e12.2 Boolean Algebra and Binary Decision Diagram 206\u003c\/p\u003e \u003cp\u003e12.3 Symbolic Evolution of Place-Timed Petri Nets 207\u003c\/p\u003e \u003cp\u003e12.4 Symbolic Heuristic Search 213\u003c\/p\u003e \u003cp\u003e12.5 Illustrative Examples 218\u003c\/p\u003e \u003cp\u003e12.6 Concluding Remarks 224\u003c\/p\u003e \u003cp\u003e12.7 Bibliographical Notes 226\u003c\/p\u003e \u003cp\u003e\u003cb\u003e13 Open Problems \u003c\/b\u003e\u003cb\u003e227\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e13.1 Structural Analysis of Generalized Nets 227\u003c\/p\u003e \u003cp\u003e13.2 Robust Supervisor Synthesis with Unreliable Resources 227\u003c\/p\u003e \u003cp\u003e13.3 Alleviation of the State Explosion Problem 228\u003c\/p\u003e \u003cp\u003e13.4 Optimization of Symbolic Variable Ordering 229\u003c\/p\u003e \u003cp\u003e13.5 Multiobjective Scheduling 230\u003c\/p\u003e \u003cp\u003e13.6 Anytime Heuristic Scheduling 230\u003c\/p\u003e \u003cp\u003e13.7 Parallel Heuristic Search 231\u003c\/p\u003e \u003cp\u003e13.8 Bidirectional Heuristic Search 232\u003c\/p\u003e \u003cp\u003e13.9 Computing and Scheduling with GPUs 232\u003c\/p\u003e \u003cp\u003eReferences 235\u003c\/p\u003e \u003cp\u003eIndex 253\u003c\/p\u003e","brand":"John Wiley \u0026 Sons Inc","offers":[{"title":"Default Title","offer_id":49407101206871,"sku":"9781119619680","price":101.66,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0817\/1739\/5799\/files\/9781119619680.jpg?v=1730498181","url":"https:\/\/bookcurl.com\/products\/supervisory-control-and-scheduling-of-resource-allocation-systems-9781119619680","provider":"Book Curl","version":"1.0","type":"link"}