Permanent faults : This type of failure is persistent: it continues to exist until the faulty component is repaired or replaced. Examples of this fault are disk head crashes, software bugs, and burnt-out power supplies. Any of these faults may be either a fail-silent failure (also known as a fail-stop) or a Byzantine failure. A fail-silent fault is one where the faulty unit stops functioning an...

In this paper we propose a dynamically reconfigurable failure recovery scheme developed for Network-on-Chip (NoC) based systems. The recovery scheme is based on a checkpointing and rollback protocol and permits enhancing the system fault tolerance capabilities by exploiting information on traffic load and failure rate. The increased performance of the fault tolerance mechanism is achieved by si...

The fault location technology research of three-layer network system structure dynamic has important theoretic value and apparent engineering application value on exploring the fault detection and localization of the complex structure dynamic system. In this article, the method of failure propagation and adverse inference are adopted, the fault location algorithm of the three-layer structure dy...

We investigate the fault-tolerance of distributed algorithms in asynchronous message passing systems with undetectable process failures. We introduce failure locality as a measure of the fault-tolerance of distributed algorithms. This measure captures the general idea of allowing part of a system to continue to function despite the failure of other parts of the system. We concentrate on two pro...

Whether a task can be completed after a failure of one of the degrees-of-freedom of a redundant manipulator depends on the joint angle at which the failure takes place. It is possible to achieve fault tolerance by globally planning a trajectory that avoids unfavorable joint positions before a failure occurs. In this paper, we present a trajectory planning algorithm that guarantees fault toleran...

Failure detection is one of the most fundamental modules of any fault-tolerant distributed system. The failure detectors discussed in the literature so far are either impossible to implement in an asynchronous system, or their exact guarantees have not been discussed. We introduce a failure detector called innnitely often accurate failure detector which can be implemented in an asynchronous sys...

Modern distributed applications rely upon the functionality of services from multiple providers. Mission-critical services, possibly shared by multiple applications, must be replicated to guarantee correct execution and availability in spite of arbitrary (Byzantine) faults. Furthermore, shared services must enforce strict fault isolation policies to prevent cascading failures across organizatio...

In this paper, we have modified the Jelinski-Moranda (J-M) model of software reliability using imperfect debugging process in fault removal activity. The J-M model was developed assuming the debugging process to be perfect which implies that there is one-to-one correspondence between the number of failures observed and faults removed. But in reality, it is possible that the fault which is suppo...

A method of performing analog/mixed signal test will be described based on the assumption that: 1. All failure modes do not have to be defined. 2. The majority of failures are described by catastrophic faults [1-3]. Working forward from these assumptions, a comprehensive method will be presented that results in identifying a test suite that can serve either as a product acceptance test or a fie...

It has been usual to consider that the steps of program refinement start with a program specification and end with the production of the text of an executable program. But for fault-tolerance, the program must be capable of taking account of the failure modes of the particular architecture on which it is to be executed. In this thesis we shall develop a formal framework which shows how a progra...