Optimal supervisory control of automated manufacturing systems

Library	Item Barcode	Call Number	Material Type	Item Category 1	Status
Searching... PSZ JB	30000010316426	TS183 C44 2013	Open Access Book	Book	Searching... Unknown
Searching... PSZ KL	33000000000722	TS183 C44 2013	Open Access Book	Book	Searching... Unknown

This monograph presents the state-of-the-art developments in the design of behaviorally and structurally optimal livenessen-forcing Petri net supervisors with computationally tractable approaches. It details optimal supervisory control problems arising in automated production systems and outlines a methodology to achieve the optimality purposes of deadlock prevention via converting a variety of problems under consideration into integer linear programming models. The book includes a reference bibliography at the end of each chapter and a complete index.

Author Notes

Chen, Yufeng; Li, Zhiwu

Preface	p. iii
Acknowledgements	p. vii
Acronyms	p. xiii
Authors	p. xv
1 Introduction	p. 1
1.1 Automated Manufacturing Systems	p. 1
1.2 Supervisory Control of Automated Manufacturing Systems	p. 3
1.3 Summary	p. 5
1.4 Bibliographical Remarks	p. 5
References	p. 6
2 Preliminaries	p. 11
2.1 Introduction	p. 11
2.2 Petri Nets	p. 12
2.2.1 Basic Concepts	p. 12
2.2.2 Structural Analysis	p. 15
2.2.3 Reachability Graph	p. 17
2.3 Binary Decision Diagrams	p. 19
2.3.1 Boolean Algebra	p. 19
2.3.2 Binary Decision Diagrams	p. 21
2.4 Bibliographical Remarks	p. 22
References	p. 22
3 Symbolic Computation and Analysis of Petri Nets	p. 26
3.1 Introduction	p. 26
3.2 Symbolic Modeling of Bounded Petri Nets	p. 27
3.3 Efficient Computation of a Reachability Set	p. 28
3.4 Symbolic Analysis of a Reachability Graph	p. 31
3.4.1 Conversely Firing Policy	p. 31
3.4.2 Efficient Computation of Legal Markings and FBMs	p. 33
3.4.3 Experimental Results	p. 36
3.5 Efficient Computation of Minimal Siphons	p. 40
3.5.1 Symbolic Representation of Siphons	p. 40
3.5.2 Symbolic Extraction of Minimal Siphons	p. 41
3.5.3 An Illustrative Example	p. 44
3.5.4 Experimental Results	p. 47
3.6 Conclusions	p. 49
3.7 Bibliographical Remarks	p. 50
References	p. 50
4 Supervisor Design Based on the Theory of Regions	p. 53
4.1 Introduction	p. 53
4.2 The Theory of Regions	p. 54
4.3 An Illustrative Example	p. 59
4.4 Conclusions	p. 61
4.5 Bibliographical Remarks	p. 61
References	p. 62
5 Maximally Permissive Supervisors	p. 64
5.1 Introduction	p. 64
5.2 Control Place Computation	p. 66
5.2.1 Control Place Computation for a Place Invariant	p. 66
5.2.2 Optimal Control Place Synthesis	p. 67
5.3 Vector Covering Approach for Place Invariant Control	p. 68
5.4 Symbolic Computation of the Vector Covering Approach	p. 72
5.5 Deadlock Prevention Policy	p. 75
5.6 Experimental Results	p. 80
5.7 Conclusions	p. 91
5.8 Bibliographical Remarks	p. 92
References	p. 93
6 Most Permissive Supervisors	p. 95
6.1 Introduction	p. 95
6.2 Best Control Place Synthesis	p. 97
6.3 Deadlock Prevention Policy	p. 99
6.4 Experimental Results	p. 103
6.5 Conclusions	p. 106
6.6 Bibliographical Remarks	p. 107
References	p. 107
7 Structurally Minimal Supervisors	p. 109
7.1 Introduction	p. 109
7.2 Synthesis of Minimum Control Places	p. 110
7.3 Deadlock Prevention Policy	p. 112
7.4 Experimental Results	p. 118
7.5 Conclusions	p. 123
7.6 Bibliographical Remarks	p. 123
References	p. 124
8 Behaviorally Optimal and Structurally Simple Supervisors	p. 126
8.1 Introduction	p. 126
8.2 Control Place Synthesis for FBMs	p. 127
8.3 Deadlock Prevention Policy	p. 131
8.4 Experimental Results	p. 138
8.5 Conclusions	p. 144
8.6 Bibliographical Remarks	p. 145
References	p. 145
9 Forbidden State Problems	p. 148
9.1 Introduction	p. 148
9.2 Forbidden State Problems	p. 150
9.2.1 Reachability Graph Generation under Forbidden States	p. 151
9.2.2 Optimal Monitor Synthesis	p. 152
9.2.3 Vector Covering Approach for a Minimal Supervisory Structure	p. 153
9.3 Structurally and Behaviorally Optimal Supervisor	p. 155
9.4 Most Permissive Supervisor Design	p. 161
9.5 Examples	p. 163
9.6 GMEC Problems	p. 167
9.7 Conclusions	p. 169
9.8 Bibliographical Remarks	p. 169
References	p. 170
10 Conclusions and Open Problems	p. 172
10.1 Conclusions	p. 172
10.2 Open Problems	p. 174
10.2.1 Siphons in an S 3 PR	p. 174
10.2.2 Iterative Deadlock Control Approach	p. 175
10.2.3 Optimal Supervisor Design Problem	p. 177
10.2.4 Supervisor Design with Minimized Costs	p. 178
10.2.5 Elementary Siphons in CPN or ROPN	p. 179
10.2.6 Fault-tolerate Deadlock Control	p. 179
10.2.7 Existence of Optimal Supervisors	p. 179
10.2.8 Deadlock Avoidance with Polynomial Complexity	p. 180
References	p. 180
Glossary	p. 183
Index	p. 187

Available:*

On Order

Summary

Summary

Author Notes

Table of Contents