| List of Figures | p. ix |
| List of Tables | p. xiii |
| Decentralized Systems and Control | |
| Recent Advances on the Control of Partially-Observed Discrete-Event Systems | p. 3 |
| Introduction | p. 3 |
| Centralized Control Under Partial Observation | p. 5 |
| Decentralized Control | p. 7 |
| Synthesis of Safe Solutions | p. 12 |
| Improving on gdec | p. 13 |
| Conclusion | p. 16 |
| From Global Specifications to Distributed Implementations | p. 19 |
| Introduction | p. 19 |
| Distributed transition systems | p. 20 |
| The synthesis problem | p. 23 |
| Synthesis modulo isomorphism | p. 24 |
| Loosely Cooperating systems | p. 24 |
| Synchronously communicating systems | p. 26 |
| Synthesis modulo language equivalence | p. 26 |
| Loosely Cooperating systems | p. 27 |
| Synchronously communicating systems | p. 28 |
| Synthesis modulo bisimulation | p. 30 |
| The synthesis problem for concurrent alphabets | p. 32 |
| Discussion | p. 34 |
| Problems and Examples of Decentralized Observation and Control | p. 37 |
| Introduction | p. 38 |
| Decentralized Observation and Control Problems | p. 38 |
| Study of the Decentralized Observation Problem | p. 40 |
| Study of the Decentralized Control Problem | p. 43 |
| Illustration: the Alternating Bit Protocol | p. 45 |
| Variations: the reliable-transmission problem with one-symbol channels and finite or infinite buffer capacity | p. 47 |
| One channel two-symbol, the other channel one-symbol, bounded buffers | p. 47 |
| One channel two-symbol, the other channel one-symbol, unbounded buffers | p. 49 |
| Both channels one-symbol | p. 50 |
| Related work | p. 51 |
| Conclusion | p. 55 |
| Towards Synthesis of ACMs | p. 57 |
| Introduction | p. 57 |
| Definition of the basic Signal | p. 59 |
| State graph specification of a simple Signal | p. 61 |
| Petri net synthesis | p. 65 |
| Algorithmic Implementation | p. 67 |
| Fewer or more slots | p. 69 |
| Conclusions | p. 73 |
| STCT: An Efficient Algorithm for Supervisory Control Design | p. 77 |
| Introduction | p. 77 |
| Structural predicates and control synthesis | p. 79 |
| Synthesis algorithm for simple DES | p. 79 |
| Synthesis algorithm for complex DES | p. 81 |
| Implementation of supervisory controller by structural predicate | p. 82 |
| Algorithm, IDDs, optimization and complexity | p. 82 |
| Operations necessary to complete the synthesis | p. 83 |
| Ordering of variables | p. 85 |
| Incremental computation on buffer sizes | p. 87 |
| A conceptual complexity analysis | p. 87 |
| Estimate of | |
| Examples | p. 90 |
| Transfer Line | p. 90 |
| Workcell | p. 95 |
| FMS | p. 97 |
| Conclusions | p. 98 |
| Modular Design | |
| Towards Modular Synthesis of EN Systems | p. 103 |
| Introduction | p. 103 |
| An example | p. 105 |
| Formal definitions and results | p. 107 |
| Conclusion | p. 112 |
| Adaptive Supervisory Control | p. 115 |
| Introduction | p. 115 |
| Timed discrete event models | p. 117 |
| Adaptive supervisory control paradigm | p. 119 |
| Mode detectors | p. 120 |
| Extensions and future work | p. 122 |
| Modelling with Petri Modules | p. 125 |
| Introduction | p. 125 |
| Petri Modules | p. 127 |
| Conclusion | p. 137 |
| Petri Net Supervision | |
| Optimal Petri Net Monitor Design | p. 141 |
| Introduction | p. 141 |
| Background | p. 143 |
| Petri nets | p. 143 |
| Generalized Mutual Exclusion Constraints | p. 144 |
| Monitor approach | p. 145 |
| Optimal monitor design | p. 146 |
| Conclusions | p. 152 |
| Live and Maximally Permissive Controller Synthesis Using Theory of Regions | p. 155 |
| Introduction | p. 155 |
| Problem Setting | p. 156 |
| The Theory of Regions | p. 157 |
| Petri Net Controller Synthesis | p. 158 |
| Computing the Controlled Behavior | p. 159 |
| Generating Control Places | p. 160 |
| Application | p. 161 |
| Conclusion | p. 164 |
| Design of Observers/Controllers for DES using PNs | p. 167 |
| Background | p. 171 |
| Marking estimation with event observation | p. 172 |
| Main idea | p. 172 |
| Estimation algorithm | p. 174 |
| Elementary properties | p. 175 |
| Observability properties | p. 175 |
| Control using observers | p. 177 |
| Conclusions | p. 181 |
| Nonblocking, Liveness and Concurrency | |
| Implementation Considerations in Supervisory Control | p. 185 |
| Introduction | p. 186 |
| Supervisory Control Theory | p. 186 |
| Languages | p. 187 |
| Discrete-Event Systems | p. 187 |
| Supervisors | p. 188 |
| Implementations | p. 189 |
| Ensuring Implementation Independence | p. 190 |
| Termination | p. 191 |
| Confluence | p. 192 |
| Nonblocking under Control | p. 193 |
| Main result | p. 194 |
| A Small Example | p. 196 |
| Conclusions | p. 200 |
| Liveness Enforcing Supervision for Sequential Resource Allocation Systems | p. 203 |
| Liveness Enforcing Supervision of Sequential RAS: A Supervisory Control-based Characterization and the Complexity of the Resulting Problem | p. 205 |
| Polynomial-Kernel Liveness Enforcing Supervisors and a RAS Taxonomy | p. 206 |
| Automating the Synthesis of PK-LES for sequential RAS through Petri net-based Structural Analysis | p. 207 |
| Conclusions and Remaining Open Issues | p. 208 |
| Looking for Diamonds | p. 213 |
| Nets with self-loops | p. 214 |
| Elementary Nets | p. 214 |
| Pure Petri nets | p. 217 |
| Marked graphs | p. 217 |
| Safe marked graphs | p. 218 |
| Conclusion | p. 219 |
| Table of Contents provided by Syndetics. All Rights Reserved. |