CLOSURE AND CONVERGENCE - A FOUNDATION OF FAULT-TOLERANT COMPUTING

被引:132
作者
ARORA, A [1 ]
GOUDA, M [1 ]
机构
[1] UNIV TEXAS, DEPT COMP SCI, AUSTIN, TX 78712 USA
关键词
ALGORITHMS; CLOSURE; CONVERGENCE; DESIGN; FAULT-TOLERANCE; MASKING; RELIABILITY; STABILIZING; VERIFICATION;
D O I
10.1109/32.256850
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We give a formal definition of what it means for a system to ''tolerate'' a class of ''faults.'' The definition consists of two conditions: One, if a fault occurs when the system state is within a set of ''legal'' states, the resulting state is within some larger set and, if faults continue occurring, the system state remains within that larger set (closure). And two, if faults stop occurring, the system eventually reaches a state within the legal set (convergence). We demonstrate the applicability of our definition for specifying and verifying the fault-tolerance properties of a variety of digital and computer systems. Further, using the definition, we obtain a simple classification of fault-tolerant systems and discuss methods for their systematic design.
引用
收藏
页码:1015 / 1027
页数:13
相关论文
共 40 条
[1]  
ANDERSON T, 1982, P FTCS, V12, P29
[2]  
ARORA A, 1990, LECT NOTES COMPUT SC, V472, P316
[3]  
ARORA A, 1994, UNPUB INT C DISTRIBU
[4]  
ARORA A, 1992, THESIS U TEXAS AUSTI
[5]  
ARORA A, 1992, 22ND P FAULT TOL COM, P396
[6]  
AVIZIENIS A, 1982, 12TH P INT S FAULT T, P6
[7]   A CLASS OF INHERENTLY FAULT TOLERANT DISTRIBUTED PROGRAMS [J].
BASTANI, FB ;
YEN, IL ;
CHEN, IR .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1988, 14 (10) :1432-1442
[8]  
Bernstein Philip A., 1987, CONCURRENCY CONTROL
[9]  
Breuer M. A., 1976, DIAGNOSIS RELIABLE D
[10]  
BROWN G, 1989, 8TH P S REL DISTR SY, P80