Coding approaches to fault tolerance in combinational and dynamic systems

MaRDI QIDQ2770033zbMATH OpenFDO

Authors Christoforos N. Hadjicostis

Publication date 6 February 2002

Published in The Kluwer International Series in Engineering and Computer Science (Search for Journal in Brave)

zbMATH Keywords

dynamic systemsfault-tolerant system

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Fault detection; testing in circuits and networks (94C12)

Review text

A fault-tolerant system is able to tolerate internal faults and preserve desirable overall behavior and output. A necessary condition for a system to be fault-tolerant is that it exhibit redundancy, which enables it to distinguish between correct and incorrect results or between valid and invalid states. This book consists of two parts. NEWLINENEWLINENEWLINEThe first part deals with fault-tolerant combinational ( i.e., memoryless) systems. Chapter 2 reviews von Neumann's work on ``Probabilistic Logics and the Synthesis of Reliable Organisms from Unreliable Components, the first systematic approaches to fault-tolerance, including some more recent work on noisy gates. Work on arithmetic coding and algorithm-based fault-tolerant scheme in algebraic settings is described in Chapter 3. NEWLINENEWLINENEWLINEThe second part of this book focuses on fault-tolerance in dynamic systems, such as finite-state machines. This part describes a systematic methodology for adding structured redundancy to a dynamic system, exposing a wide range of possibilities between no redundancy and full replication. These possibilities can be parameterized in various settings, including algebraic machines (Chapter 4) and linear dynamic systems (Chapters 5 and 6). NEWLINENEWLINENEWLINEChapter 7 relaxes the traditional assumption that the error-correcting mechanism does not fail by using distributed error-correcting mechanism. The final chapter presents a methodology for fault diagnosis in discrete event systems that are described by Petri nets; coding techniques are used to detect and identify failures. NEWLINENEWLINENEWLINEThis book emphasizes resource-efficient methodology that avoid excessive use of redundancy by exploiting the algorithmic/dynamic structure of a particular combinational or dynamic system.

Recommendations

• Coding Approaches to Fault Tolerance in Linear Dynamic Systems
• Fault-tolerant computation in groups and semigroups: Applications to automata, dynamic systems and Petri nets
• scientific article; zbMATH DE number 47521
• Code Design for Dependable Systems
• Structured redundancy for fault tolerance in state-space models and Petri nets.

Cited in

(14)

• Fault tolerant computing and reliable communication: A unified approach
• Fault-tolerant systems with concurrent error-locating capability
• Operability restoration procedure for fault-tolerant digital systems with dynamic redundancy
• Fault-tolerant computation in groups and semigroups: Applications to automata, dynamic systems and Petri nets
• Error detection and correction in switched linear controllers via periodic and non-concurrent checks
• Redundancy-based intrusion tolerance approaches moving from classical fault tolerance methods
• Fault tolerant arithmetic unit using duplication and residue codes
• Coding Approaches to Fault Tolerance in Linear Dynamic Systems
• scientific article; zbMATH DE number 3922533 (Why is no real title available?)
• Structured redundancy for fault tolerance in state-space models and Petri nets.
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• Coding Techniques for Failure- Tolerant Counters
• Fault-tolerant search algorithms. Reliable computation with unreliable information
• Periodic and non-concurrent error detection and identification in one-hot encoded FSMs

This page was built for publication: Coding approaches to fault tolerance in combinational and dynamic systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2770033)