Fault masking in tri-redundant systems

Authors:
Mohamed G. Gouda;Jorge A. Cobb;Chin-Tser Huang
Affiliations:
Department of Computer Sciences, The University of Texas at Austin;Department of Computer Science, The University of Texas at Dallas;Department of Computer Science and Engineering, University of South Carolina at Columbia
Venue:
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Year:
2006

Citing 8
Cited 2

A self-stabilizing algorithm for constructing spanning trees

Information Processing Letters
Closure and Convergence: A Foundation of Fault-Tolerant Computing

IEEE Transactions on Software Engineering - Special issue on software reliability
Fault-containing self-stabilizing algorithms

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Self-stabilization

Self-stabilization
Error-detecting codes and fault-containing self-stabilization

Information Processing Letters
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Enabling Snap-Stabilization

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
State Checksum and Its Role in System Stabilization

ICDCSW '05 Proceedings of the Fourth International Workshop on Assurance in Distributed Systems and Networks (ADSN) (ICDCSW'05) - Volume 01

Safe and Eventually Safe: Comparing Self-stabilizing and Non-stabilizing Algorithms on a Common Ground

OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Brief announcement: deterministic self-stabilizing leader election with O(log log n)-bits

Proceedings of the 2013 ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A tri-redundant version of a system S is a system T that is specified from S as follows. First, system T has the same number of processes and the same topology as system S. Second, each variable x in a process in system S is replaced by three variables x, x′, and x″ in the corresponding process in system T. Third, the actions in each process in system S are modified before they are added to the corresponding process in system T and some new actions are added to the corresponding process in system T. In this paper, we show that a tri-redundant version T of a system S has interesting stabilization and fault-masking properties. In particular, we show that if S is stabilizing, then T is also stabilizing. We also show that if T ever reaches stabilization, and then a "visible fault" occurs, then the effect of the fault is masked and the reached stabilization of T remains in effect.