Application of information theory to sequential fault diagnosis

Pramod K. Varshney, Carlos R.P. Hartmann, Jamie M. De Faria

Research output: Contribution to journalArticle

26 Scopus citations

Abstract

In this correspondence we consider the problem of the construction of efficient sequential fault location experiments for permanent faults. The construction of optimum sequential experiments is an NP-complete problem and, therefore, a heuristic approach for the design of near-optimum sequential experiments is considered. The approach is based on information theoretic concepts and the suggested algorithm for the construction of near-optimum sequential fault location experiments is systematic, has a sound theoretical justification, and yet has low design complexity.

Original languageEnglish (US)
Pages (from-to)164-170
Number of pages7
JournalIEEE Transactions on Computers
VolumeC-31
Issue number2
DOIs
StatePublished - Feb 1982

    Fingerprint

Keywords

  • Binary decision trees
  • fault diagnosis
  • fault location
  • fault-tolerant computing
  • information theory
  • sequential experiments

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this