Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems

FTRTFT 1998: Formal Techniques in Real-Time and Fault-Tolerant Systems pp 315–338Cite as

Predictability in critical systems

  • Invited Paper
  • Conference paper
  • First Online:

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

Abstract

Predictability is crucial in critical applications and systems. Therefore, we examine sources of uncertainty for each of the four phases that span a project lifecycle, from initial problem capture, to system implementation, when conducted according to proof-based system engineering principles. We explore the concept of coverage applied to problems, solutions, assumptions, along with a generic problem that arises with critical applications such as, e.g., air traffic control/management, namely the real-time uniform atomic broadcast problem. We examine two design styles, namely asynchronous and synchronous solutions, and compare the resulting assumptions as well as their coverages. The central issues of overloads and timing failures that arise with synchronous models are investigated in detail.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chandra, T.D., Toueg, S.: Unreliable Failure Detectors for Asynchronous Systems, Journal of the ACM 43(2) (March 1996) 225–267.

    Article  MATH  MathSciNet  Google Scholar 

  2. Chandra, T.D., Hadzilacos, V., Toueg, S.: The Weakest Failure Detector for Solving Consensus, 12th ACM Symposium on Principles of Distributed Computing (August 1992) 147–158.

    Google Scholar 

  3. Cristian, F.: Probabilistic Clock Synchronization, Distributed Computing (3) (1989) 146–158.

    Article  MATH  Google Scholar 

  4. Dwork, C., Lynch, N.A., Stockmeyer, L.: Consensus in the Presence of Partial Synchrony, Journal of the ACM, 35(2) (April 1988) 288–323.

    Article  MathSciNet  Google Scholar 

  5. Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of Distributed Consensus with One Faulty Process, Journal of the ACM 32(2) (April 1985) 374–382.

    Article  MATH  MathSciNet  Google Scholar 

  6. Hadzilacos, V., Toueg, S.: A Modular Approach to Fault-Tolerant Broadcasts and Related Problems, Technical Report TR 94-1425, Cornell University (May 1994), 83 p.

    Google Scholar 

  7. Hermant, J.F., Le Lann, G.: A Protocol and Correctness Proofs for Real-Time High-Performance Broadcast Networks, 18th IEEE Intl. Conference on Distributed Computing Systems (May 1998) 360–369.

    Google Scholar 

  8. Kuhn, D.R.: Sources of Failure in the Public Switched Telephone Network, IEEE Computer (April 1997) 31–36.

    Google Scholar 

  9. Lamport, L., Shostak, R., Pease, M.: The Byzantine Generals Problem, ACM Trans. on Programming Languages and Systems 4(3) (July 1982) 382–401.

    Article  MATH  Google Scholar 

  10. Le Lann, G.: Proof-Based System Engineering and Embedded Systems, in Embedded Systems, Springer-Verlag LNCS on Embedded Systems (G. Rozenberg, F. Vaandrager Eds.) (to appear in 1998) 41 p.

    Google Scholar 

  11. Le Lann, G.: On Real-Time and Non Real-Time Distributed Computing, invited paper, 9th Intl. Workshop on Distributed Algorithms, Springer-Verlag LNCS 972 (J.M. Hélary, M. Raynal Eds.) (1995) 51–70.

    Google Scholar 

  12. Le Lann, G.: An Analysis of the Ariane 5 Flight 501 Failure — A System Engineering Perspective, IEEE Intl. Conference on the Engineering of Computer-Based Systems (March 1997) 339–346.

    Google Scholar 

  13. Leveson, N.G., Turner, C.: An Investigation of the Therac-25 Accidents, IEEE Computer (July 1993) 18–41.

    Google Scholar 

  14. Liebeherr, J., Wrege, D.E., Ferrari, D.: Exact Admission Control for Networks with a Bounded Delay Service, IEEE/ACM Trans. on Networking, 4(6) (December 1996) 885–901.

    Article  Google Scholar 

  15. Lundelius, J., Lynch, N.A.: An Upper and Lower Bound for Clock Synchronization, Information and Control 62(2–3) (August–September 1984) 190–204.

    Article  MATH  MathSciNet  Google Scholar 

  16. Lynch, N.A.: Distributed Algorithms, Morgan Kaufmann Pub., ISBN 1-55860-348-4 (1996) 872 p.

    Google Scholar 

  17. Powell, D.: Failure Mode Assumptions and Assumption Coverage, 22nd IEEE Intl. Symposium on Fault-Tolerant Computing (July 1992) 386–395.

    Google Scholar 

  18. Special Issue on Global Time in Large Scale Distributed Real-Time Systems, Schmid, U. Guest Editor, Journal of Real-Time Systems 12(1–2) (1997) 230 p.

    Google Scholar 

  19. Tindell, K., Burns, A., Wellings, A.J.: Analysis of Hard Real-Time Communications, Journal of Real-Time Systems 9(2) (1995) 147–171.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Projet REFLECS, INRIA, BP 105, F-78153, Le Chesnay Cedex, France

    Gérard Le Lann

Authors
  1. Gérard Le Lann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Anders P. Ravn Hans Rischel

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Le Lann, G. (1998). Predictability in critical systems. In: Ravn, A.P., Rischel, H. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT 1998. Lecture Notes in Computer Science, vol 1486. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055361

Download citation

  • DOI: https://doi.org/10.1007/BFb0055361

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65003-4

  • Online ISBN: 978-3-540-49792-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation