Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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 diagnose faults 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.

Automation. --- Engineering mathematics. --- Engineering --- Bioengineering. --- Mathematical and Computational Engineering Applications. --- Biological and Physical Engineering. --- Data processing. --- Biological engineering --- Life science engineering --- Biology --- Synthetic biology --- Engineering analysis --- Mathematical analysis --- Automatic factories --- Automatic production --- Computer control --- Engineering cybernetics --- Factories --- Industrial engineering --- Mechanization --- Assembly-line methods --- Automatic control --- Automatic machinery --- CAD/CAM systems --- Robotics --- Mathematics --- Automation