Decision Trees for Fault Diagnosis in Circuits and Switching Networks

Busbait, Monther, Moshkov, Mikhail, Moshkova, Albina

  • 出版商: Springer
  • 出版日期: 2024-08-12
  • 售價: $4,630
  • 貴賓價: 9.5$4,399
  • 語言: 英文
  • 頁數: 130
  • 裝訂: Quality Paper - also called trade paper
  • ISBN: 3031390334
  • ISBN-13: 9783031390333
  • 海外代購書籍(需單獨結帳)

相關主題

商品描述

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.


商品描述(中文翻譯)

在本書中,我們研究用於電路和切換網路故障診斷的決策樹,這些是計算布林函數的最基本模型之一。我們考慮兩種主要情況:當方案(電路或切換網路)在計算和診斷時具有相同的操作模式,以及當方案具有兩種操作模式——正常模式用於計算,特殊模式用於診斷。在前一種情況下,我們得到的結果大多是負面的,包括根據方案的複雜性而得出的診斷決策樹最小深度的超多項式下界,以及構建診斷決策樹的 NP-hard 性。在後一種情況下,我們描述了可以有效用於診斷方案的決策樹的方案類別和故障類型,當它們被轉換為所謂的無迭代方案時。

本書中討論的工具和結果有助於理解使用決策樹診斷各種方案故障的可能性和挑戰。本書對於理論和技術診斷領域的專家都非常有用,也可以用於為研究生創建課程。