Rupak Majumdar
ABSTRACT
Systems working in uncertain environments should possess a robustness property, which ensures that the behaviours of the system remain close to the original behaviours under the influence of unmodeled, but bounded, disturbances. We present a theory and algorithmic tools for the design of robust discrete controllers for π-regular properties on discrete transition systems. Formally, we define metric automata - automata equipped with a metric on states - and strategies on metric automata which guarantee robustness for π-regular properties. We present graph-theoretic algorithms to construct such strategies in polynomial time. In contrast to strategies computed by classical automata-theoretic algorithms, the strategies computed by our algorithm ensure that the behaviours of the controlled system under disturbances satisfy a related property which depends on the magnitude of the disturbance. We show an application of our theory to the design of controllers that tolerate infinitely many transient errors provided they occur infrequently enough.
- 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. Google Scholar
Digital Library
- R. Bellman. Dynamic Programming. Princeton University Press, 1957.Google Scholar
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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.Google Scholar
- S. Borkar. Electronics Beyond Nano-scale CMOS. In DAC 06: Design Automation Conference. ACM, 2006. Google ScholarDigital Library
- M. S. Branicky. Topology of hybrid systems. In CDC 93: Conference on Decision and Control, pages 2309--2314. IEEE, 1993.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- E. W. Dijkstra. Self-stabilizing systems in spite of distributed control. Communications of the ACM, 17(11):643--644, 1974. Google ScholarDigital Library
- E. A. Emerson and C. Jutla. Tree automata, mu-calculus and determinacy. In FOCS 91: Foundations of Computer Science, pages 368--377. IEEE, 1991. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- S. Golshan and E. Bozorgzadeh. Single-Event-Upset (SEU) Awareness in FPGA Routing. In DAC 07: Design Automation Conference. ACM, 2007. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- N. Klarlund. Progress measures and finite arguments for infinite computations. PhD thesis, Cornell University, 1990. Google ScholarDigital Library
- S. Krishnaswamy, S. Plaza, I. Markov, and J. Hayes. Signature-based SER analysis and design of logic circuits. Trans. CAD. ACM, 2009. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- R. McNaughton. Infinite gam,es played on finite graphs. Annals of Pure and Applied Logic, 65(2):149--184, 1993.Google ScholarCross Ref
- N. Miskov-Zivanov and D. Marculescu. Formal modeling and reasoning for reliability analysis. In DAC 10: Design Automation Conference, pages 531--536. ACM, 2010. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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.Google Scholar
- E. Normand. Single event upset at ground level. IEEE Transactions on Nuclear Science, 43(6):2742--2750, 1996.Google ScholarCross Ref
- G. Pola, A. Girard, and P. Tabuada. Approximately bisimilar symbolic models for nonlinear control systems. Automatica, 44(10):2508--2516, 2008. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- 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.Google Scholar
- 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. Google ScholarDigital Library
- J. F. Wakerly. Digital Design Principles and Practices. Prentice Hall, 1994. Google ScholarDigital Library
- M. Zamani, G. Pola, and Paulo Tabuada. Symbolic models for unstable nonlinear control systems. In Proceedings of the 2010 American Control Conference, 2010.Google ScholarCross Ref
- K. Zhou, J. Doyle, and K. Glover. Robust and Optimal Control. Prentice Hall, 1996. Google ScholarDigital Library
- W. Zielonka. Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theor. Comput. Sci., 200(1-2):135--183, 1998. Google ScholarDigital Library
Index Terms
- Robust discrete synthesis against unspecified disturbances
Recommendations
A theory of robust omega-regular software synthesis
A key property for systems subject to uncertainty in their operating environment is robustness: ensuring that unmodeled but bounded disturbances have only a proportionally bounded effect upon the behaviors of the system. Inspired by ideas from robust ...
Brief Nonlinear servocompensation of unknown external disturbances
The problem of adaptive compensation of unknown external disturbances is solved for a class of nonlinear systems which have the globally defined normal form. When an a priori unknown external disturbance can be accurately modeled as the output of a ...
Direct adaptive robust NN control for a class of discrete-time nonlinear strict-feedback SISO systems
Special Issue on LSMS2010 and ICSEE 2010In this paper, a direct adaptive neural network control algorithm based on the backstepping technique is proposed for a class of uncertain nonlinear discrete-time systems in the strict-feedback form. The neural networks are utilized to approximate ...
Comments