Christoforos N. Hadjicostis - Böcker

This title describes coding approaches for designing fault-tolerant systems, that is, 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 the book focuses on fault-tolerant combinational systems providing a review of von Neumann's classical work on probabilistic logics (including some work on noisy gates) and describing the use of arithmetic coding and algorithm-based fault-tolerant schemes in algebraic settings. The second focuses on fault tolerance in dynamic systems. The text 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.

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 TechnologyCoding 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.

Estimation and Inference in Discrete Event Systems chooses a popular model for emerging automation systems—finite automata under partial observation—and focuses on a comprehensive study of the key problems of state estimation and event inference. The text includes treatment of current, delayed, and initial state estimation. Related applications for assessing and enforcing resiliency—fault detection and diagnosis—and security—privacy and opacity—properties are discussed, enabling the reader to apply these techniques in a variety of emerging applications, among them automated manufacturing processes, intelligent vehicle/highway systems, and autonomous vehicles.The book provides a systematic development of recursive algorithms for state estimation and event inference. The author also deals with the verification of pertinent properties such as:the ability to determine the exact state of a system, “detectability”;the ability to ensure that certain classes of faults can be detected/identified, “diagnosability”; andthe ability to ensure that certain internal state variables of the system remain “hidden” from the outside world regardless of the type of activity that is taking place, “opacity”.This book allows students, researchers and practicing engineers alike to grasp basic aspects of state estimation in discrete event systems, aspects like distributivity and probabilistic inference, quickly and without having to master the entire breadth of models that are available in the literature.