Performability is a composite measure for the performance and reliability, which may be interpreted as the cumulative performance over a nite mission time. The computation of its distribution allows the user to ensure that the system will achieve a given performance level. The system is assumed to be modeled as a Markov process with nite state space and a reward rate (performance measure) is as...

This paper describes the design, implementation and usage of a secure scalable Byzantine fault tolerant MDS system in the Grid. The scalable Byzantine fault tolerant MDS system provides a hierarchy GIIS servers, a local GIIS domain can require the resource it needs from remote GIIS domain. By using the statemachine replication approach and quorum system technique, the scalable Byzantine fault t...

An architectural analysis for a fault-tolerant quantum computer is thoroughly presented: With 1,000 superconducting circuit components, problems currently intractable classical computers could be solved.

Fault tolerant control for uncertain systems with time varying state-delay is studied in this paper. Based on sliding mode controller design, a fault tolerant control method is proposed. By means of the feasibility of some linear matrix inequalities (LMIs), delay dependent sufficient condition is derived for the existence of a linear sliding surface which guarantees quadratic stability of the r...

Distributed system can also be referred to as the process of running a single computational task on more than one distinct computer. There are a lot of advantages in distributed system including the ability to connect remote users with remote resources in an open and scalable way. A distributed system must be reliable and for it to be truly reliable it must possess the following characteristics...

This paper presents the results obtained in a continuing investigation of fault-tolerant computing which is being conducted at the Jet Propulsion Laborator\'. Initial studies led to the decision to design and construct an experimental computer with dynamic (standby) redundancy, including replaceable subsystems and a program rollback provision to eliminate transient errors. This system, called t...

ions for Fault Tolerant Global Computing Tom Chothia and Dominic Duggan Department of Computer Science Stevens Institute of Technology Hoboken, NJ 07030 USA.

In this paper, we present an approach to embed our formal Generic Fault Tolerant Software Architecture (GFTSA) model in the PVS theorem prover to achieve automatic verification support for reasoning about fault tolerant system properties. In order to make the verification process more efficient and systematic, we also propose a template approach for the auto-generation of specifications and pro...

Fault trees provide a graphical and logical framework for analyzing the reliability of systems. A fault tree provides a conceptually simple modeling framework to represent the system-level interactions between component reliabilities. Dynamic fault trees have been shown particularly useful for reliability analysis of embedded computer systems. Dynamic fault trees are a superset of traditional (...

Application of formal methods helps us to gain confidence in building correct software. On the other hand, to guarantee dependability of the overall system we need to build fault tolerant software, i.e., software which is not only fault-free but also is able to cope with faults of other system components. Obviously, this goal is attainable only if fault tolerance mechanisms constitute an intrin...