Abstract
In this chapter, we study decision trees for diagnosis faults that consist in embedding gates implementing functions from a fault basis into circuits. It is shown that, for arbitrary circuit and fault bases, the minimum depth of diagnostic decision trees in the worst case grows depending on the complexity of the circuits, either superpolynomially, or linearly, or is bounded from above by a constant.
Original language | English (US) |
---|---|
Title of host publication | Studies in Systems, Decision and Control |
Publisher | Springer Science and Business Media Deutschland GmbH |
Pages | 43-51 |
Number of pages | 9 |
DOIs | |
State | Published - 2023 |
Publication series
Name | Studies in Systems, Decision and Control |
---|---|
Volume | 493 |
ISSN (Print) | 2198-4182 |
ISSN (Electronic) | 2198-4190 |
Bibliographical note
Publisher Copyright:© 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.
ASJC Scopus subject areas
- Computer Science (miscellaneous)
- Control and Systems Engineering
- Automotive Engineering
- Social Sciences (miscellaneous)
- Economics, Econometrics and Finance (miscellaneous)
- Control and Optimization
- Decision Sciences (miscellaneous)