In this paper, a new very fast fault simulation method to handle the X-fault model is proposed. The method is based on a two-phase procedure. In the first phase, a parallel exact critical path fault tracing is used to determine all the detected stuck-at faults in the circuit, and in the second phase a postprocess is launched which will determine the detectability of X-faults. Keywords-digital c...

In this paper, an efficient scheme to detect and classify faults in a system using kalman filtering and hybrid neuro-fuzzy computing techniques, respectively, is proposed. A fault is detected whenever the moving average of the Kalman filter residual exceeds a threshold value. The fault classification has been made effective by implementing a hybrid neuro-fuzzy Inference system. By doing so, the...

Software-implemented approaches to fault tolerance are very resilient to change since evolution in hardware technology does not require extensive re-design of specialized hardware. This paper argues the case for implementing fault tolerance in a distributed fashion and reports the approach adopted in the European Delta-4 project. Fault tolerance is achieved by replicating capsules (the run-time...

Fault tolerance is becoming an increasingly important issue, especially in mission-critical applications where data integrity is a paramount concern. Performance, however, remains a large driving force in the market place. Runtime reconfigurable hardware architectures have the power to balance fault tolerance with performance, allowing the amount of fault tolerance to be tuned at run-time. This...

Fault-tolerant clock synchronization is an important requirement in many distributed systems , especially in time-critical and safety-critical applications. Frequently, interactive convergence algorithms are used for fault-tolerant clock synchronization, providing advantages such as fully distributed operation, low message exchange overhead, and simplicity of implementation. This paper presents...

We survey scheduling algorithms proposed for tolerating permanent and transient failures in real-time embedded systems. These algorithms attempt to provide low-cost solutions to fault tolerance, graceful performance degradation, and load shedding in such systems by exploiting tradeoffs between space and/or time redundancy, timing accuracy, and quality of service. We place fault-tolerant schedul...

Time-triggered systems require a very high degree of temporal accuracy at critical stages during run time. While many software fault injection environments exist today, none of these make provisions to meet the timing requirements of such sys-

Remote handling (RH) systems are used to inspect, make changes to, and maintain components in the ITER machine and as such are an example of mission-critical system. Failure in a critical system may cause damage, significant financial losses and loss of experiment runtime, making dependability one of their most important properties. However, even if the software for RH control systems has been ...

the current internet inherently has a degree of survivability due to the connection less ip protocol. dynamic routing protocols are designed to react to faults by changing routes when routers learn about topology changes via routing information updates (e.g., link status advertisements). loss of quality of service (qos) has not been an issue because current internet traffic is the best-effort. ...