Tracing Fault Tolerance
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 χ.
KeywordsOutput Channel Cyclic Redundancy Check Read Request Positive Acknowledgement Exceptional Behaviour
Unable to display preview. Download preview PDF.
- C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall International, 1985.Google Scholar
- 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
- P. A Lee, T. Anderson. Fault tolerance: principles and practice. Springer-Verlag, 1990.Google Scholar
- 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
- J. Zwiers. Compositionality, concurrency and partial correctness. Lecture Notes in Computer Science, Vol. 321, Springer-Verlag, 1989.Google Scholar