Skip to main content
SpringerLink
Log in

On fault-tolerant symbolic computations

  • Session 5
  • Conference paper
  • First Online:
Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 571))

  • 178 Accesses

Abstract

In this paper we propose a model that captures the influence of noise on the correct behavior of a computing device. Within this model we analyze the relation between structural properties of automata and their immunity to noise. We prove upper- and lower-bounds on the effect of noise for various classes of finite automata. Our model, combining basic notions from algebraic automata theory and the theory of stochastic processes, can serve as a starting point for a rigorous theory of computational systems embedded in the real world.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Berstel and D. Perrin, Theory of Codes, Academic Press, New-York, 1985.

    Google Scholar 

  2. E.W. Dijkstra, Self-stabilizing Systems in Spite of Distributed Control, Comm. of the ACM 17, 643–644, 1974.

    Google Scholar 

  3. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979.

    Google Scholar 

  4. J.G. Kemeny and J.L. Snell, Finite Markov Chains, Van Nostrand, New York, 1960.

    Google Scholar 

  5. G. Lallement, Semigroups and Combinatorial Applications, Wiley, New-York, 1979.

    Google Scholar 

  6. O. Maler, Z. Manna and A. Pnueli, From Timed to Hybrid Systems, to appear in: Proc. of the REX Workshop “Real-Time, Theory in Practice”, Springer, Berlin, 1992.

    Google Scholar 

  7. A. Paz, Introduction to Probabilistic Automata, Academic Press, New-York, 1970.

    Google Scholar 

  8. M.O. Rabin, Probabilistic Automata, Information and Control 6, 230–245, 1963.

    Google Scholar 

  9. P.J.G. Ramadge and W.M. Wonham, The Control of Discrete Event Systems, Proc. of the IEEE 77, 81–98, 1989.

    Google Scholar 

  10. L.G. Valiant, A Theory of the Learnable, Comm. of the ACM 27, 1134–1142, 1984.

    Google Scholar 

  11. R.M. Wharton, Approximate Language Identification, Information and Control 26, 236–255, 1974.

    Google Scholar 

  12. J. Von Neumann, Probabilistic Logics and the Synthesis of Reliable Organisms from Unreliable Components, in Automata Studies, 205–228, Princeton University Press, Princeton, 1956.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA/IRISA, Campus de Beaulieu, 35042, Rennes, France

    Bernard Delyon & Oded Maler

Authors
  1. Bernard Delyon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oded Maler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan Vytopil

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Delyon, B., Maler, O. (1991). On fault-tolerant symbolic computations. In: Vytopil, J. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT 1992. Lecture Notes in Computer Science, vol 571. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55092-5_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-55092-5_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55092-1

  • Online ISBN: 978-3-540-46692-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation