Robust discrete synthesis against unspecified disturbances

HSCC'11 - Proceedings of the 2011 ACM/SIGBED Hybrid Systems: Computation and Control

Volumn , Issue , 2011, Pages 211-220

  Majumdar, Rupak ^a,b   Render, Elaine ^b   Tabuada, Paulo ^b  

^a MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Cyber physical systems; Linear temporal logic; Robustness

Indexed keywords

ALGORITHMIC TOOLS; CONTROLLED SYSTEM; CYBER-PHYSICAL SYSTEMS; DISCRETE CONTROLLERS; DISCRETE TRANSITIONS; GRAPH-THEORETIC; LINEAR TEMPORAL LOGIC; POLYNOMIAL-TIME; ROBUSTNESS; ROBUSTNESS PROPERTIES; TRANSIENT ERRORS; UNCERTAIN ENVIRONMENTS;

ALGORITHMS; CONTROLLERS; EMBEDDED SYSTEMS; GRAPH THEORY; HYBRID COMPUTERS; HYBRID SYSTEMS; POLYNOMIAL APPROXIMATION; ROBUSTNESS (CONTROL SYSTEMS); TEMPORAL LOGIC;

CONTROL SYSTEM SYNTHESIS;

EID: 79956041462     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1967701.1967732     Document Type: Conference Paper

References (29)

1. A. Arora and M. G. Gouda. Closure and convergence: a foundation of fault tolerant computing. IEEE Transactions on Software Engineering, 19(11):1015-1027, 1993.
2. R. Bellman. Dynamic Programming. Princeton University Press, 1957.
3. R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, and B. Jobstmann. Robustness in the presence of liveness. In CAV 2010, volume 6174 of Lecture Notes in Computer Science, pages 410-424. Springer, 2010.
4. R. Bloem, K. Chatterjee, T. A. Henzinger, and B. Jobstmann. Better quality in synthesis through quantitative objectives. In CAV 2009: Computer-Aided Verification, volume 5643 of Lecture Notes in Computer Science, pages 140-156. Springer-Verlag, 2009.
5. R. Bloem, K. Greimel, T.A. Henzinger, and B. Jobstmann. Synthesizing robust systems. In FMCAD 09: Formal Methods in Computer-Aided Design, pages 85-92. IEEE, 2009.
6. S. Borkar. Electronics Beyond Nano-scale CMOS. In DAC 06: Design Automation Conference. ACM, 2006.
7. M.S. Branicky. Topology of hybrid systems. In CDC 93: Conference on Decision and Control, pages 2309-2314. IEEE, 1993.
8. P. Cerný, T. A. Henzinger, and A. Radhakrishna. Simulation distances. In CONCUR 2010 - Concurrency Theory, volume 6269 of Lecture Notes in Computer Science, pages 253-268. Springer-Verlag, 2010.
9. E. W. Dijkstra. Self-stabilizing systems in spite of distributed control. Communications of the ACM, 17(11):643-644, 1974.
10. E.A. Emerson and C. Jutla. Tree automata, mu-calculus and determinacy. In FOCS 91: Foundations of Computer Science, pages 368-377. IEEE, 1991.
11. A. Girault and E. Rutten. Automating the addition of fault tolerance with discrete controller synthesis. Formal Methods in System Design, 35(2):190-225, 2009.
12. S. Golshan and E. Bozorgzadeh. Single-Event-Upset (SEU) Awareness in FPGA Routing. In DAC 07: Design Automation Conference. ACM, 2007.
13. Y. Hu, Z. Feng, L. He, and R. Majumdar. Robust FPGA resynthesis based on fault-tolerant boolean matching. In ICCAD 08: International Conference on Computer-Aided Design. ACM, 2008.
14. N. Klarlund. Progress measures and finite arguments for infinite computations. PhD thesis, Cornell University, 1990.
15. S. Krishnaswamy, S. Plaza, I. Markov, and J. Hayes. Signature-based SER analysis and design of logic circuits. Trans. CAD. ACM, 2009.
16. A. Lesea, S. Drimer, J.J. Fabula, C. Carmichael, and P. Alfke. The Rosetta experiment: atmospheric soft error rate testing in differing technology FPGAs. IEEE Transactions on Device and Materials Reliability, 5(3):317-328, 2005. (Pubitemid 43003053)
17. R. McNaughton. Infinite gam, es played on finite graphs. Annals of Pure and Applied Logic, 65(2):149-184, 1993.
18. N. Miskov-Zivanov and D. Marculescu. Formal modeling and reasoning for reliability analysis. In DAC 10: Design Automation Conference, pages 531-536. ACM, 2010.
19. K. Namjoshi. Certifying model checkers. In CAV 01: Computer Aided Verification, volume 2102 of Lecture Notes in Computer Science, pages 2-13. Springer-Verlag, 2001. (Pubitemid 33312900)
20. A. Nerode and W. Kohn. Models for hybrid systems: Automata, topologies, controllability, observability. In Hybrid Systems, volume 736 of Lecture Notes in Computer Science, pages 297-316. Springer-Verlag, 1993.
21. E. Normand. Single event upset at ground level. IEEE Transactions on Nuclear Science, 43(6):2742-2750, 1996. (Pubitemid 126770925)
22. G. Pola, A. Girard, and P. Tabuada. Approximately bisimilar symbolic models for nonlinear control systems. Automatica, 44(10):2508-2516, 2008.
23. D.C. Tarraf, A. Megretski, and M.A. Dahleh. A framework for robust stability of systems over finite alphabets. IEEE Transactions on Automatic Control, 53(5):1133-1146, 2008.
24. W. Thomas. On the synthesis of strategies in infinite games. In STACS 95: Theoretical Aspects of Computer Science, volume 900 of Lecture Notes in Computer Science, pages 1-13. Springer-Verlag, 1995.
25. A.J. van der Schaft. L2-Gain and Passivity Techniques in Nonlinear Control, volume 218 of Lecture Notes in Control and Information Sciences. Springer-Verlag, 2000.
26. J.F. Wakerly. Digital Design Principles and Practices. Prentice Hall, 1994.
27. M. Zamani, G. Pola, and Paulo Tabuada. Symbolic models for unstable nonlinear control systems. In Proceedings of the 2010 American Control Conference, 2010.
28. K. Zhou, J. Doyle, and K. Glover. Robust and Optimal Control. Prentice Hall, 1996.
29. W. Zielonka. Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theor. Comput. Sci., 200(1-2):135-183, 1998. (Pubitemid 128450815)