Read more
In this book, we study decision trees for fault diagnosis in circuits and switching networks, which are among the most fundamental models for computing Boolean functions. We consider two main cases: when the scheme (circuit or switching network) has the same mode of operation for both calculation and diagnostics, and when the scheme has two modes of operation-normal for calculation and special for diagnostics. In the former case, we get mostly negative results, including superpolynomial lower bounds on the minimum depth of diagnostic decision trees depending on scheme complexity and the NP-hardness of construction diagnostic decision trees. In the latter case, we describe classes of schemes and types of faults for which decision trees can be effectively used to diagnose schemes, when they are transformed into so-called iteration-free schemes.
The tools and results discussed in this book help to understand both the possibilities and challenges of using decision trees to diagnosefaults in various schemes. The book is useful to specialists both in the field of theoretical and technical diagnostics.It can also be used for the creation of courses for graduate students.
List of contents
Introduction.- Diagnosis of constant Faults at Inputs of Gates in Circuits.- Diagnosis of Embedding Faults in Circuits.- Diagnosis of Extensions of Constant Faults in Circuits.- Diagnosis of Retaining Faults in Circuits.- Diagnosis of Constant Faults in Switching Networks.
Report
"The book is structured on 6 chapters, each ending with references and an appendix. ... The book ends with an appendix presenting closed classes of Boolean functions, final remarks and an index of terms. It can be interesting for readers in the field of both theoretic and technical diagnosis, helping understanding the advantages and limitations of using decision trees to diagnose faults in various circuits." (Liviu Goras, zbMATH 1541.94093, 2024)
