skip to main content
research-article

A theory of robust omega-regular software synthesis

Authors Info & Claims
Published:24 December 2013Publication History
Skip Abstract Section

Abstract

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 control and dissipative systems theory, we present a formal definition of robustness as well as algorithmic tools for the design of optimally robust 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 fixed-point algorithms to construct optimally robust strategies in polynomial time. In contrast to strategies computed by classical graph theoretic approaches, the strategies computed by our algorithm ensure that the behaviors of the controlled system gracefully degrade under the action of disturbances; the degree of degradation is parameterized by 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.

References

  1. Arora, A. and Gouda, M. G. 1993. Closure and convergence: A foundation of fault tolerant computing. IEEE Trans. Softw. Eng. 19, 11, 1015--1027. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Bellman, R. 1954. The theory of dynamic programming. Bull. Amer. Math. Soc. 60, 503--516.Google ScholarGoogle ScholarCross RefCross Ref
  3. Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T., and Jobstmann, B. 2010. Robustness in the presence of liveness. In Computer-Aided Verification. Lecture Notes in Computer Science, vol. 6174, Springer-Verlag, Berlin, 410--424. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Bloem, R., Chatterjee, K., Henzinger, T. A., and Jobstmann, B. 2009a. Better quality in synthesis through quantitative objectives. In Computer-Aided Verification. Lecture Notes in Computer Science, vol. 5643, Springer-Verlag, Berlin, 140--156. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Bloem, R., Greimel, K., Henzinger, T., and Jobstmann, B. 2009b. Synthesizing robust systems. In Proceedings of the Conference on Formal Methods in Computer-Aided Design (FMCAD'09). IEEE, 85--92.Google ScholarGoogle Scholar
  6. Borkar, S. 2006. Electronics beyond nano-scale CMOS. In Proceedings of the Design Automation Conference (DAC'06). ACM, 807--808. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Branicky, M. 1993. Topology of hybrid systems. In Proceedings of the 32nd IEEE Conference on Decision and Control. 2309--2314.Google ScholarGoogle ScholarCross RefCross Ref
  8. Cerný, P., Henzinger, T. A., and Radhakrishna, A. 2010. Simulation distances. In Concurrency Theory. Lecture Notes in Computer Science, vol. 6269, Springer-Verlag, Berlin, 253--268. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Dijkstra, E. W. 1974. Self-stabilizing systems in spite of distributed control. Comm. ACM 17, 11, 643--644. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Emerson, E. and Jutla, C. 1991. Tree automata, mu-calculus and determinacy. In Proceedings of the 32th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, 368--377. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Girault, A. and Rutten, E. 2009. Automating the addition of fault tolerance with discrete controller synthesis. Formal Methods Syst. Des. 35, 2, 190--225. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Golshan, S. and Bozorgzadeh, E. 2007. Single-event-upset (SEU) awareness in FPGA routing. In Proceedings of the Design Automation Conference (DAC'07). ACM, 330--333. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Hu, Y., Feng, Z., He, L., and Majumdar, R. 2008. Robust FPGA resynthesis based on fault-tolerant boolean matching. In Proceedings of the International Conference on Computer-Aided Design (ICCAD'08). ACM, 706--713. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Klarlund, N. 1990. Progress measures and finite arguments for infinite computations. Ph.D. Dissertation, Cornell University. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Krishnaswamy, S., Plaza, S., Markov, I., and Hayes, J. 2009. Signature-based ser analysis and design of logic circuits. IEEE Trans. CAD Integr. Circuits Syst. 28, 1, 74--86. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Lesea, A., Drimer, S., Fabula, J., Carmichael, C., and Alfke, P. 2005. The Rosetta experiment: Atmospheric soft error rate testing in differing technology FPGAs. IEEE Trans. Device Materials Reliab. 5, 3, 317--328.Google ScholarGoogle ScholarCross RefCross Ref
  17. Lynch, N. 1996. Distributed Algorithms. Morgan Kaufmann, Burlington, MA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. McNaughton, R. 1993. Infinite games played on finite graphs. Ann. Pure Appl. Logic 65, 2, 149--184.Google ScholarGoogle ScholarCross RefCross Ref
  19. Miskov-Zivanov, N. and Marculescu, D. 2010. Formal modeling and reasoning for reliability analysis. In Proceedings of the Design Automation Conference (DAC'10). ACM, 531--536. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Namjoshi, K. 2001. Certifying model checkers. In Computer Aided Verification. Lecture Notes in Computer Science, vol. 2102, Springer-Verlag, Berlin, 2--13. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Nerode, A. and Kohn, W. 1993. Models for hybrid systems: Automata, topologies, controllability, observability. In Hybrid Systems. Lecture Notes in Computer Science, vol. 736, Springer-Verlag, Berlin, 297--316. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Normand, E. 1996. Single event upset at ground level. IEEE Trans. Nuclear Sci. 43, 6, 2742--2750.Google ScholarGoogle ScholarCross RefCross Ref
  23. Pola, G., Girard, A., and Tabuada, P. 2008. Approximately bisimilar symbolic models for nonlinear control systems. Automatica 44, 10, 2508--2516. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Tarraf, D., Megretski, A., and Dahleh, M. 2008. A framework for robust stability of systems over finite alphabets. IEEE Trans. Autom. Control 53, 5, 1133--1146.Google ScholarGoogle ScholarCross RefCross Ref
  25. Thomas, W. 1995. On the synthesis of strategies in infinite games. In Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol. 900, Springer-Verlag, Berlin, 1--13.Google ScholarGoogle ScholarCross RefCross Ref
  26. van der Schaft, A. 2000. L2-Gain and Passivity Techniques in Nonlinear Control. Lecture Notes in Control and Information Sciences, vol. 218, Springer-Verlag, Berlin. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Wakerly, J. 1994. Digital Design Principles and Practices. Prentice Hall, Upper Saddle River, NJ. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Zamani, M., Pola, G., and Tabuada, P. 2010. Symbolic models for unstable nonlinear control systems. In Proceedings of the American Control Conference.Google ScholarGoogle Scholar
  29. Zhou, K., Doyle, J., and Glover, K. 1996. Robust and Optimal Control. Prentice Hall, Upper Saddle River, NJ. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Zielonka, W. 1998. Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theor. Comput. Sci. 200, 1--2, 135--183. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A theory of robust omega-regular software synthesis

                Recommendations

                Comments

                Login options

                Check if you have access through your login credentials or your institution to get full access on this article.

                Sign in

                Full Access

                PDF Format

                View or Download as a PDF file.

                PDF

                eReader

                View online with eReader.

                eReader
                About Cookies On This Site

                We use cookies to ensure that we give you the best experience on our website.

                Learn more

                Got it!