The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (1993 vol.19)
pp: 1015-1027
ABSTRACT
<p>The authors formally define what it means for a system to tolerate a class of faults. The definition consists of two conditions. The first is that if a fault occurs when the system state is within the set of legal states, the resulting state is within some larger set and, if faults continue to occur, the system state remains within that larger set (closure). The second is that if faults stop occurring, the system eventually reaches a state within the legal set (convergence). The applicability of the definition for specifying and verifying the fault-tolerance properties of a variety of digital and computer systems is demonstrated. Using the definition, the authors obtain a simple classification of fault-tolerant systems. Methods for the systematic design of such systems are discussed.</p>
INDEX TERMS
fault-tolerant computing; legal states; convergence; closure; verification; fault tolerant computing; formal verification
CITATION
A. Arora, M. Gouda, "Closure and Convergence: A Foundation of Fault-Tolerant Computing", IEEE Transactions on Software Engineering, vol.19, no. 11, pp. 1015-1027, November 1993, doi:10.1109/32.256850
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool