Tracing Fault Tolerance

  • Henk Schepers
Part of the Dependable Computing and Fault-Tolerant Systems book series (DEPENDABLECOMP, volume 8)


A fault may cause a process to behave abnormally, and a fault hypothesis divides such abnormal behaviour into exceptional and catastrophic behaviours. The set of normal and exceptional behaviours can be considered the set of acceptable behaviours. In this report traces, or communication histories, are used to denote the behaviour of a process. The semantic function ℋ[P] defines the set of possible communication sequences that can be observed up to any point in an execution of process P. A fault hypothesis is defined as a predicate representing a reflexive relation between the normal and acceptable histories of a process. Such relations enable one to abstract from the precise nature of a fault and to focus on the exceptional behaviour it causes. For a fault hypothesis χ the construct (P≀χ) indicates execution of process P under the assumption of χ. Then, the set ℋ[(P≀χ)] is the set of acceptable histories of P with respect to χ.


Output Channel Cyclic Redundancy Check Read Request Positive Acknowledgement Exceptional Behaviour 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    K. A. Bartlett, R. A. Scantlebury, P. T. Wilkinson. A note on reliable full-duplex transmission over half-duplex links. Communications of the ACM, Vol. 12, No. 5, 1969, pp. 260–261.CrossRefGoogle Scholar
  2. [2]
    F. Cristian. A rigorous approach to fault-tolerant programming. IEEE Transaction on Software Engineering, Vol. SE-11, No. 1, pp. 23–31, 1985.CrossRefGoogle Scholar
  3. [3]
    T. A. Henzinger, Z. Manna, A. Pnueli. Timed transition systems. Lecture Notes in Computer Science, Vol. 600, Springer-Verlag, 1992, pp. 226–251.MathSciNetCrossRefGoogle Scholar
  4. [4]
    C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall International, 1985.Google Scholar
  5. [5]
    M. Joseph, A. Moitra, N. Soundararajan. Proof rules for fault tolerant distributed programs. Science of Computer Programming, Vol. 8, 1987, pp. 43–67.MathSciNetMATHCrossRefGoogle Scholar
  6. [6]
    L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, Vol. 21, No. 7, 1978, pp. 558–565.MATHCrossRefGoogle Scholar
  7. [7]
    J. C. Laprie. Dependable computing and fault tolerance: concepts and terminology. Proc. 15th IEEE Int. Symp. on Fault Tolerant Computing, Ann Arbor, Mich., 1985, pp. 2-11.Google Scholar
  8. [8]
    P. A Lee, T. Anderson. Fault tolerance: principles and practice. Springer-Verlag, 1990.Google Scholar
  9. [9]
    J. Peleska. Design and verification of fault tolerant systems with CSP. Distributed Computing, Vol. 5, 1991, pp. 95–106.MATHCrossRefGoogle Scholar
  10. [10]
    H. Schepers. Terminology and paradigms for fault tolerance. Report CSN 91-08, Eindhoven University of Technology, 1991. Also to appear in: J. Vytopil (ed.). Formal Techniques in Real-Time and Fault Tolerant Systems. Kluwer Academic Publishers, 1993.Google Scholar
  11. [11]
    R. D. Schlichting, F. B. Schneider. Fail-stop processors: an approach to designing fault tolerant computing systems. ACM Transaction on Computer Systems, Vol. 1, No. 3, 1983, pp. 222–238.CrossRefGoogle Scholar
  12. [12]
    F. B. Schneider. Implementing fault tolerant services using the state machine approach: a tutorial. ACM Computing Surveys, Vol. 22, No. 4, 1990, pp. 299–319.CrossRefGoogle Scholar
  13. [13]
    D. G. Weber. Formal specification of fault-tolerance and its relation to computer security. ACM Software Engineering Notes, Vol. 14, No. 3, 1989, pp. 273–277.CrossRefGoogle Scholar
  14. [14]
    J. Zwiers. Compositionality, concurrency and partial correctness. Lecture Notes in Computer Science, Vol. 321, Springer-Verlag, 1989.Google Scholar

Copyright information

© Springer-Verlag Wien 1993

Authors and Affiliations

  • Henk Schepers
    • 1
  1. 1.Department of Mathematics and Computing ScienceEindhoven University of TechnologyEindhovenThe Netherlands

Personalised recommendations