The fault tolerance of random graphs with unbounded degrees with respect to connectivity is investigated. It is related to the reliability of wireless sensor networks with unreliable relay nodes. The model evaluates the network breakdown probability that a graph is disconnected after stochastic node removal. To establish a mean-field approximation for the model, the cavity method for finite sys...

When testing from Finite State Machines (FSMs), a failure observed in the Implementation Under Test (IUT) is called a symptom. A symptom could have been caused by an earlier state transfer failure. Transitions that may be used to explain the observed symptoms are called diagnosing candidates. Finding strategies to generate an optimal set of diagnosing candidates that could effectively identify ...

In the area of testing communication systems, the interfaces between systems to be tested and their testers have great impact on test generation and fault detectability. Several types of such interfaces have been standardized by the International Standardization Organization (ISO). A general distributed test architecture, containing distributed interfaces, has been presented in the literature f...

In this paper, we employ the Communicating finite state machine (CFSM) model for networks to investigate fault management using passive testing. First, we introduce the concept of passive testing. Then, we introduce the CFSM model and the observer model with necessary assumptions and justification. We introduce the fault model and the fault detection algorithm using passive testing. We present ...

This paper studies recursive optimal filtering as well as robust fault and state estimation for linear stochastic systems with unknown disturbances. It proposes a new recursive optimal filter structure with transformation of the original system. This transformation is based on the singular value decomposition of the direct feedthrough matrix distribution of the fault which is assumed to be of a...

The Generalized Likelihood Ratio (GLR) test for fault detection as derived by Willsky and Jones is a recursive method to detect additive changes in linear systems in a Kalman filter framework. Here, we evaluate the GLR test on a sliding window and compare it to stochastic parity space approaches. Robust fault detection defined as being insensitive to faults in the signal space is also studied i...

We rigorously analyze Knill’s Fibonacci scheme for fault-tolerant quantum computation, which is based on the recursive preparation of Bell states protected by a concatenated error-detecting code. We prove lower bounds on the threshold fault rate of 0.67 10−3 for adversarial local stochastic noise, and 1.25 10−3 for independent depolarizing noise. In contrast to other schemes with comparable pro...