Vor Ort
Merkzettel Warenkorb
Produktbild: Supervisory Control and Scheduling of Resource Allocation Systems

Supervisory Control and Scheduling of Resource Allocation Systems Reachability Graph Perspective

Aus der Reihe IEEE Press Series on Systems Science and Engineering

162,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Gebundene Ausgabe

Erscheinungsdatum

28.07.2020

Verlag

John Wiley & Sons Inc

Seitenzahl

288

Maße (L/B/H)

22,9/15,2/1,8 cm

Gewicht

549 g

Auflage

1. Auflage

Sprache

Englisch

ISBN

978-1-119-61968-0

Beschreibung

Produktdetails

Einband

Gebundene Ausgabe

Erscheinungsdatum

28.07.2020

Verlag

John Wiley & Sons Inc

Seitenzahl

288

Maße (L/B/H)

22,9/15,2/1,8 cm

Gewicht

549 g

Auflage

1. Auflage

Sprache

Englisch

ISBN

978-1-119-61968-0

Herstelleradresse

Libri GmbH
Europaallee 1
36244 Bad Hersfeld
DE

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
Die Leseprobe wird geladen.
  • Produktbild: Supervisory Control and Scheduling of Resource Allocation Systems

  • Preface xi

    Acknowledgments xvii

    Glossary xix

    Acronyms xxiii

    About the Authors xxv

    Part I Resource Allocation Systems and Petri Nets 1

    1 Introduction 3

    1.1 Resource Allocation Systems 3

    1.2 Supervisory Control and Scheduling with Petri Nets 7

    1.3 Summary 9

    1.4 Bibliographical Notes 9

    2 Preliminaries 11

    2.1 Introduction 11

    2.2 Petri Nets 12

    2.3 Informed Heuristic Search 35

    2.4 Bibliographical Notes 37

    Part II Supervisory Control 39

    3 Behaviorally Maximal and Structurally Minimal Supervisor 41

    3.1 Introduction 41

    3.2 Petri Nets for Supervisory Synthesis 43

    3.3 Optimal and Minimal Supervisory Synthesis 45

    3.4 An Illustrative Example 52

    3.5 Concluding Remarks 54

    3.6 Bibliographical Notes 55

    4 Supervisor Design with Fewer Places 57

    4.1 Introduction 57

    4.2 Critical and Free Activity Places 59

    4.3 Properties of DP-Nets 62

    4.4 Supervisor Design with Critical Activity Places 66

    4.5 An Illustrative Example 70

    4.6 Concluding Remarks 72

    4.7 Bibliographical Notes 73

    5 Redundant Constraint Elimination 75

    5.1 Introduction 75

    5.2 Minimal-Number-of-Monitors Problem 77

    5.3 Elimination of Redundant Constraints 78

    5.4 Illustrative Examples 85

    5.5 Concluding Remarks 91

    5.6 Bibliographical Notes 91

    6 Fast Iterative Supervisor Design 93

    6.1 Introduction 93

    6.2 Optimal Supervisor of a DP-net 94

    6.3 Fast Synthesis of Optimal and Simple Supervisors 95

    6.4 Illustrative Examples 107

    6.5 Concluding Remarks 115

    6.6 Bibliographical Notes 115

    7 Supervisor Synthesis with Uncontrollable and Unobservable Transitions 117

    7.1 Introduction 117

    7.2 Supervisor Synthesis with Uncontrollability and Unobservability 119

    7.3 Deadlock Prevention Policy 127

    7.4 Illustrative Experiments 132

    7.5 Concluding Remarks 136

    7.6 Bibliographical Notes 136

    Part III Heuristic Scheduling 137

    8 Informed Heuristic Search in Reachability Graph 139

    8.1 Introduction 139

    8.2 System Scheduling with Place-Timed Petri Nets 140

    8.3 State Evolution of Place-Timed Nets 145

    8.4 A* Search on a Reachability Graph 152

    8.5 A* Search with State Check 153

    8.6 An Illustrative Example 155

    8.7 Concluding Remarks 156

    8.8 Bibliographical Notes 156

    9 Controllable Heuristic Search 157

    9.1 Introduction 157

    9.2 Alternative Routes with Different Lengths 159

    9.3 An Admissible Heuristic for SC-nets 160

    9.4 A Controllable Heuristic Search 163

    9.5 Randomly Generated Examples 166

    9.6 Another Controllable Heuristic Search 168

    9.6.1 A* Search and Depth-First Search 168

    9.6.2 Controllable Hybrid Heuristic Search 171

    9.7 Illustrative Results 176

    9.8 Concluding Remarks 178

    9.9 Bibliographical Notes 179

    10 Hybrid Heuristic Search 181

    10.1 Introduction 181

    10.2 A*-BT Combinations 182

    10.3 Illustrative Examples 187

    10.4 Concluding Remarks 190

    10.5 Bibliographical Notes 191

    11 A* Search with More Informed Heuristics Functions 193

    11.1 Introduction 193

    11.2 More Informed Heuristics in A* Search 194

    11.3 Combination of Admissible and Inadmissible Heuristics 195

    11.4 Illustrative Examples 197

    11.5 Concluding Remarks 203

    11.6 Bibliographical Notes 204

    12 Symbolic Heuristic Search 205

    12.1 Introduction 205

    12.2 Boolean Algebra and Binary Decision Diagram 206

    12.3 Symbolic Evolution of Place-Timed Pe