Muutke küpsiste eelistusi

E-raamat: Supervisory Control and Scheduling of Resource Allocation Systems: Reachability Graph Perspective

,
Teised raamatud teemal:
  • Formaat - EPUB+DRM
  • Hind: 139,49 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
  • Raamatukogudele
Supervisory Control and Scheduling of Resource Allocation Systems: Reachability Graph PerspectiveSuurem pilt
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

"This book presents Petri net (PN) models and methods for supervisory control and system scheduling of resource allocation systems (RASs) which are common in practice, such as automated manufacturing systems, project management systems, cloud data centers, and software engineering systems. It begins with a brief definition of the Supervisory Control and Scheduling problems of RAS. Then, different types of Petri net models of RASs and their analysis methods are presented. Next, the book is divided into two parts to provide different speed-up methodologies with numerical experiments for supervisory control and heuristic scheduling, respectively. Conclusions and open problems are provided in the last part of the book"--

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 &8;exible routings.

Preface xi
Acknowledgments xvii
Glossary xix
Acronyms xxiii
About the Authors xxv
Part I Resource Allocation Systems and Petri Nets
1(38)
1 Introduction
3(8)
1.1 Resource Allocation Systems
3(4)
1.2 Supervisory Control and Scheduling with Petri Nets
7(2)
1.3 Summary
9(1)
1.4 Bibliographical Notes
9(2)
2 Preliminaries
11(28)
2.1 Introduction
11(1)
2.2 Petri Nets
12(23)
2.2.1 Basic Concepts
12(4)
2.2.2 Modeling Power of Petri Nets
16(1)
2.2.2.1 Sequential Execution
16(1)
2.2.2.2 Concurrency (Parallelism)
17(1)
2.2.2.3 Synchronization
17(1)
2.2.2.4 Conflict (choice)
17(1)
2.2.2.5 Merging
17(1)
2.2.2.6 Mutual Exclusion
17(1)
2.2.3 Behavioral Properties of Petri Nets
18(1)
2.2.3.1 Boundedness and Safeness
18(1)
2.2.3.2 Liveness and Deadlock
19(1)
2.2.3.3 Reversibility
19(1)
2.2.3.4 Conservativeness
19(1)
2.2.4 Subclasses of Petri Nets
20(1)
2.2.4.1 Ordinary Nets and Generalized Nets
20(1)
2.2.4.2 Pure Petri Nets
20(1)
2.2.4.3 State Machines
21(1)
2.2.4.4 Marked Graphs
22(1)
2.2.4.5 Free-choice Nets
22(1)
2.2.4.6 Extended Free-choice Nets
22(1)
2.2.4.7 Asymmetric Choice Nets
22(1)
2.2.5 Petri Nets for Resource Allocation Systems
22(1)
2.2.5.1 PC2R
23(1)
2.2.5.2 S*PR
24(1)
2.2.5.3 S5PR
25(1)
2.2.5.4 S4PR, S4R, S3 PGR2 and WS3 PSR
25(1)
2.2.5.5 S3PR
26(1)
2.2.5.6 ES3PR and S3PMR
26(1)
2.2.5.7 LS3PR
27(1)
2.2.5.8 ELS3PR
27(1)
2.2.5.9 GLS3PR
28(1)
2.2.6 Structural Analysis
28(2)
2.2.7 Reachability Graph Analysis
30(1)
2.2.7.1 Supervisory Control
30(1)
2.2.7.2 System Scheduling
31(1)
2.2.8 Petri Net Analysis Tools
32(3)
2.3 Informed Heuristic Search
35(2)
2.3.1 Basic Concepts of Heuristic A* Search
35(1)
2.3.2 Properties of the A* Search
36(1)
2.3.2.1 Completeness
36(1)
2.3.2.2 Admissible Heuristics
36(1)
2.3.2.3 Monotone (Consistent) Heuristics
36(1)
2.3.2.4 More Informed Heuristics
36(1)
2.4 Bibliographical Notes
37(2)
Part II Supervisory Control
39(98)
3 Behaviorally Maximal and Structurally Minimal Supervisor
41(16)
3.1 Introduction
41(2)
3.2 Petri Nets for Supervisory Synthesis
43(2)
3.3 Optimal and Minimal Supervisory Synthesis
45(7)
3.3.1 Reachability Graph Analysis
45(2)
3.3.2 Supervisor Computation with Place Invariants
47(1)
3.3.3 Optimal Supervisor Synthesis and Vector Covering Method
47(2)
3.3.4 Optimal Supervisor with Fewest Monitors
49(1)
3.3.5 Deadlock Prevention Policy
50(2)
3.4 An Illustrative Example
52(2)
3.5 Concluding Remarks
54(1)
3.6 Bibliographical Notes
55(2)
4 Supervisor Design with Fewer Places
57(18)
4.1 Introduction
57(2)
4.2 Critical and Free Activity Places
59(3)
4.3 Properties of DP-Nets
62(4)
4.4 Supervisor Design with Critical Activity Places
66(4)
4.5 An Illustrative Example
70(2)
4.6 Concluding Remarks
72(1)
4.7 Bibliographical Notes
73(2)
5 Redundant Constraint Elimination
75(18)
5.1 Introduction
75(2)
5.2 Minimal-Number-of-Monitors Problem
77(1)
5.3 Elimination of Redundant Constraints
78(7)
5.3.1 Redundant Reachability Constraints
78(1)
5.3.2 Linear Program Method
79(3)
5.3.3 Non-Linear Program Method
82(2)
5.3.4 Supervisor Synthesis with Redundancy Elimination
84(1)
5.4 Illustrative Examples
85(6)
5.5 Concluding Remarks
91(1)
5.6 Bibliographical Notes
91(2)
6 Fast Iterative Supervisor Design
93(24)
6.1 Introduction
93(1)
6.2 Optimal Supervisor of a DP-net
94(1)
6.3 Fast Synthesis of Optimal and Simple Supervisors
95(12)
6.3.1 Multiobjective Supervisory Control
96(1)
6.3.2 Design of an Optimal Control Place
97(2)
6.3.3 Identification of Redundant Constraints
99(3)
6.3.4 Iterative Deadlock Prevention
102(5)
6.4 Illustrative Examples
107(8)
6.5 Concluding Remarks
115(1)
6.6 Bibliographical Notes
115(2)
7 Supervisor Synthesis with Uncontrollable and Unobservable Transitions
117(20)
7.1 Introduction
117(2)
7.2 Supervisor Synthesis with Uncontrollability and Unobservability
119(8)
7.2.1 DP-Nets with Uncontrollable and/or Unobservable Transitions
119(1)
7.2.2 Admissible Markings and First-Met Inadmissible Markings
120(3)
7.2.3 Design of an Admissible Monitor
123(2)
7.2.4 Admissible and Structure-Minimal Supervisor Synthesis
125(2)
7.3 Deadlock Prevention Policy
127(5)
7.4 Illustrative Experiments
132(4)
7.5 Concluding Remarks
136(1)
7.6 Bibliographical Notes
136(1)
Part III Heuristic Scheduling
137(98)
8 Informed Heuristic Search in Reachability Graph
139(18)
8.1 Introduction
139(1)
8.2 System Scheduling with Place-Timed Petri Nets
140(5)
8.2.1 Place-Timed Petri Nets
140(1)
8.2.2 Conversion from an Untuned Petri Net
141(2)
8.2.3 Synthesis of a Place-Timed Petri Net
143(1)
8.2.3.1 Top-down Method
144(1)
8.2.3.2 Bottom-up Method
145(1)
8.3 State Evolution of Place-Timed Nets
145(7)
8.4 A* Search on a Reachability Graph
152(1)
8.5 A* Search with State Check
153(2)
8.6 An Illustrative Example
155(1)
8.7 Concluding Remarks
156(1)
8.8 Bibliographical Notes
156(1)
9 Controllable Heuristic Search
157(24)
9.1 Introduction
157(2)
9.2 Alternative Routes with Different Lengths
159(1)
9.3 An Admissible Heuristic for SC-nets
160(3)
9.4 A Controllable Heuristic Search
163(3)
9.5 Randomly Generated Examples
166(2)
9.6 Another Controllable Heuristic Search
168(8)
9.6.1 A* Search and Depth-First Search
168(3)
9.6.2 Controllable Hybrid Heuristic Search
171(5)
9.7 Illustrative Results
176(2)
9.8 Concluding Remarks
178(1)
9.9 Bibliographical Notes
179(2)
10 Hybrid Heuristic Search
181(12)
10.1 Introduction
181(1)
10.2 A*-BT Combinations
182(5)
10.3 Illustrative Examples
187(3)
10.4 Concluding Remarks
190(1)
10.5 Bibliographical Notes
191(2)
11 A* Search with More Informed Heuristics Functions
193(12)
11.1 Introduction
193(1)
11.2 More Informed Heuristics in A* Search
194(1)
11.3 Combination of Admissible and Inadmissible Heuristics
195(2)
11.4 Illustrative Examples
197(6)
11.5 Concluding Remarks
203(1)
11.6 Bibliographical Notes
204(1)
12 Symbolic Heuristic Search
205(22)
12.1 Introduction
205(1)
12.2 Boolean Algebra and Binary Decision Diagram
206(1)
12.3 Symbolic Evolution of Place-Timed Petri Nets
207(6)
12.4 Symbolic Heuristic Search
213(5)
12.5 Illustrative Examples
218(6)
12.6 Concluding Remarks
224(2)
12.7 Bibliographical Notes
226(1)
13 Open Problems
227(8)
13.1 Structural Analysis of Generalized Nets
227(1)
13.2 Robust Supervisor Synthesis with Unreliable Resources
227(1)
13.3 Alleviation of the State Explosion Problem
228(1)
13.4 Optimization of Symbolic Variable Ordering
229(1)
13.5 Multiobjective Scheduling
230(1)
13.6 Anytime Heuristic Scheduling
230(1)
13.7 Parallel Heuristic Search
231(1)
13.8 Bidirectional Heuristic Search
232(1)
13.9 Computing and Scheduling with GPUs
232(3)
References 235(18)
Index 253
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).
Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97811196197036e.html
Märksõnad: