Coding approaches to fault tolerance in combinational and dynamic systems
著者
書誌事項
Coding approaches to fault tolerance in combinational and dynamic systems
（The Kluwer international series in engineering and computer science, SECS 660）
Kluwer Academic Publishers, c2002
大学図書館所蔵 件 / 全9件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references and index
内容説明・目次
内容説明
Coding Approaches to Fault Tolerance in Combinational and Dynamic Systems describes coding approaches for designing fault-tolerant systems, i.e., systems that exhibit structured redundancy that enables them to distinguish between correct and incorrect results or between valid and invalid states. Since redundancy is expensive and counter-intuitive to the traditional notion of system design, the book focuses on resource-efficient methodologies that avoid excessive use of redundancy by exploiting the algorithmic/dynamic structure of a particular combinational or dynamic system.
The first part of Coding Approaches to Fault Tolerance in Combinational and Dynamic Systems focuses on fault-tolerant combinational systems providing a review of von Neumann's classical work on Probabilistic Logics (including some more recent work on noisy gates) and describing the use of arithmetic coding and algorithm-based fault-tolerant schemes in algebraic settings. The second part of the book focuses on fault tolerance in dynamic systems. Coding Approaches to Fault Tolerance in Combinational and Dynamic Systems also discusses how, in a dynamic system setting, one can relax the traditional assumption that the error-correcting mechanism is fault-free by using distributed error correcting mechanisms. The final chapter presents a methodology for fault diagnosis in discrete event systems that are described by Petri net models; coding techniques are used to quickly detect and identify failures.
From the Foreword: "Hadjicostis has significantly expanded the setting to processes occurring in more general algebraic and dynamic systems... The book responds to the growing need to handle faults in complex digital chips and complex networked systems, and to consider the effects of faults at the design stage rather than afterwards."
George Verghese, Massachusetts Institute of Technology
Coding Approaches to Fault Tolerance in Combinational and Dynamic Systems will be of interest to both researchers and practitioners in the area of fault tolerance, systems design and control.
目次
List of Figures. List of Tables. Foreword by George Verghese. Preface. Acknowledgments. 1: Introduction. 1. Definitions, Motivation and Background. 2. Fault-Tolerant Combinational Systems. 2.1. Reliable Combinational Systems. 2.2. Minimizing Redundant Hardware. 3. Fault-Tolerant Dynamic Systems. 3.1. Redundant Implementations. 3.2. Faults in the Error-Correcting Mechanism. 4. Coding Techniques for Fault Diagnosis. Part I: Fault-Tolerant Combinational Systems. 2: Reliable Combinational Systems Out of Unreliable Components. 1. Introduction. 2. Computational Models for Combinational Systems. 3. Von Neumann's Approach to Fault Tolerance. 4. Extensions of Von Neumann's Approach. 4.1. Maximum Tolerable Noise for 3-Input Gates. 4.2. Maximum Tolerable Noise for u-Input Gates. 5. Related Work and Further Reading. 3: ABFT for Combinational Systems. 1. Introduction. 2. Arithmetic Codes. 3.Algorithm-Based Fault Tolerance. 4. Generalizations of Arithmetic Coding to Operations with Algebraic Structure. 4.1. Fault Tolerance for Abelian Group Operations. 4.1.1. Use of Group Homomorphisms. 4.1.2. Error Detection and Correction. 4.1.3. Separate Group Codes. 4.2. Fault Tolerance for Semigroup Operations. 4.2.1. Use of Semigroup Homomorphisms. 4.2.2. Error Detection and Correction. 4.2.3. Separate Semigroup Codes. 4.3. Extensions. Part II: Fault-Tolerant Dynamic Systems. 4: Redundant Implementations of Algebraic Machines. 1. Introduction. 2. Algebraic Machines: Definitions and Decompositions. 3. Redundant Implementations of Group Machines. 3.1. Separate Monitors for Group Machines. 3.2. Non-Separate Redundant Implementations for Group Machines. 4. Redundant Implementations of Semigroup Machines. 4.1. Separate Monitors for Reset-Identity Machines. 4.2. Non-Separate Redundant Implementations for Reset-Identity Machines. 5. Summary. 5: Redundant Implementations of Discrete-Time LTI Dynamic Systems. 1. Introduction. 2. Discrete-Time LTI Dynamic Systems. 3. Characterization of Redundant Implementations. 4. Hardware Implementation and Fault Model. 5. Examples of Fault-Tolerant Systems. 6. Summary. 6: Redundant Implementations of Linear Finite-state Machines. 1. Introduction. 2. Linear Finite-State Machines. 3. Characterization of Redundant Implementations. 4. Examples of Fault-Tolerant Systems. 5. Hardware Minimization in Redundant LFSM Implementations. 6. Summary. 7: Unreliable Error Correction in Dynamic Systems. 1. Introduction. 2. Fault Model for Dynamic Systems. 3. Reliable Dynamic Systems using Distributed Voting Schemes. 4. Reliable Linear Finite-State Machines. 4.1. Low-Density Parity Check Codes and Stable Memories. 4.2. Reliable Linear Finite-State Machines using Constant Redundancy. 5. Other Issues. 8: Coding A
「Nielsen BookData」 より