While conventional learning theory focus on training a neural network to attain good generalization, fault tolerant learning aims at training a neural network to attain acceptable generalization even if network fault might appear in the future. This paper presents an extensive survey on the previous work done on fault tolerant learning. Those analytical works that have been reported in the lite...

Runtime verification (RV) is a natural fit for ultra-critical systems, where correctness is imperative. In ultra-critical systems, even if the software is fault-free, because of the inherent unreliability of commodity hardware and the adversity of operational environments, processing units (and their hosted software) are replicated, and fault-tolerant algorithms are used to compare the outputs....

In this paper, we present an approach for fault-tolerant synthesis by combining predefined patterns for fault-tolerance with algorithmic game solving. A non-fault-tolerant system, together with the relevant fault hypothesis and faulttolerant mechanism templates in a pool are translated into a distributed game, and we perform an incomplete search of strategies to cope with undecidability. The re...

This thesis deals with quantum error correcting codes. In first two chapters necessary introduction to quantum computation and classical error correction is presented. Previous results on construction of quantum error correcting codes are presented in the third and fourth chapter. Mainly Calderbank-Steane-Shor (CSS) codes and stabilizer codes are discussed together with the introduction to codi...

A system is fault-tolerant if it maintains some form of correctness in the presence of faults. Fault-tolerant systems are necessary in many application areas of computing, especially where the failure of a computer system may lead to considerable damage. However, the development of fault-tolerant systems is a difficult task and requires rigorous and scientifically sound engineering methodologie...

We investigate the problem of constructing spanners for a given set of points that are tolerant for edge/vertex faults. Let S IRd be a set of n points and let k be an integer number. A k-edge/vertex fault tolerant spanner for S has the property that after the deletion of k arbitrary edges/vertices each pair of points in the remaining graph is still connected by a short path. Recently it was sho...