State Based Control of Timed Discrete Event Systems using Binary ...

More documents

Recommendations

Info

List of Figures3.1 A simple function graph . . . . . . . . . . . . . . . . . . . . . . . . . . . 143.2 BDDs for representing function F with different variable ordering . . . . 195.1 A Car parking setup and specification . . . . . . . . . . . . . . . . . . . . 335.2 Transition predicate . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 365.3 Target states . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 405.4 BW framework is not closed . . . . . . . . . . . . . . . . . . . . . . . . . 485.5 A sketch of a system with BDD based controller . . . . . . . . . . . . . . 496.1 Timed Transition Graph . . . . . . . . . . . . . . . . . . . . . . . . . . . 546.2 Transition BDD for event tick . . . . . . . . . . . . . . . . . . . . . . . . 556.3 Transition BDD for α . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 566.4 Transition BDD for β . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 576.5 The manufacturing cell . . . . . . . . . . . . . . . . . . . . . . . . . . . . 586.6 The ATG of the machines . . . . . . . . . . . . . . . . . . . . . . . . . . 596.7 Comparison between the space required in both methods. . . . . . . . . . 616.8 Number of states of the TDES vs time bound.(Both axes are logarithmic) 626.9 Number of the nodes of the transition BDD vs time bound. . . . . . . . . 626.10 Computing time vs time bound for TTCT. . . . . . . . . . . . . . . . . . 636.11 Spec1 TTG . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 636.12 Spec2 TTG . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64vi
6.13 Spec3 TTG . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 646.14 SUPCON computation time comparison between TTCT and BDD program. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 666.15 SUPCON computation space comparison between TTCT and BDD program. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 666.16 Two-machine workcell setup . . . . . . . . . . . . . . . . . . . . . . . . . 676.17 The activity transition graph for M i , i = 1, 1 . . . . . . . . . . . . . . . . 686.18 R 1 and R 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 696.19 The space requirement of each method . . . . . . . . . . . . . . . . . . . 706.20 The time requirement of each method . . . . . . . . . . . . . . . . . . . . 70vii
Page 1 and 2: State Based Control of Timed Discre
Page 3 and 4: AcknowledgementsI would like to sin
Page 5: 5.3.1 Transition Predicates . . . .
Page 9 and 10: Chapter 1. Introduction 2models.In
Page 11 and 12: Chapter 1. Introduction 4timize the
Page 13 and 14: Chapter 2. Supervisory Control of T
Page 19 and 20: Chapter 3Introduction to Binary Dec
Page 21 and 22: Chapter 3. Introduction to Binary D
Page 29 and 30: Chapter 4. Synthesis Algorithm Base
Page 39 and 40: Chapter 5BDD based implementation5.
Page 41 and 42: Chapter 5. BDD based implementation
Page 57 and 58:
Chapter 5. BDD based implementation
Page 59 and 60:
Chapter 5. BDD based implementation
Page 61 and 62:
Chapter 6. Examples 54Thus α, β a
Page 63 and 64:
Chapter 6. Examples 56from root to
Page 65 and 66:
Chapter 6. Examples 586.2 Manufactu
Page 67:
Chapter 6. Examples 60L |Q| |T |TTC
Page 70 and 71:
Chapter 6. Examples 63700060005000T
Page 72 and 73:
Chapter 6. Examples 656.2 compares
Page 74 and 75:
Chapter 6. Examples 676.3 Two-Machi
Page 76 and 77:
Chapter 6. Examples 69Figure 6.18:
Page 78 and 79:
Chapter 7Conclusions and Future Res
Page 80 and 81:
Appendix ABuDDy PackageBuDDy [17] i
Page 82 and 83:
Bibliography[1] S. B. Akers. Functi
Page 84 and 85:
Bibliography 77[18] C. Ma. Nonblock
show all

State Based Control of Timed Discrete Event Systems using Binary ...

Create successful ePaper yourself

Delete template?

Save as template?