Application of information theory to sequential fault diagnosis

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

doi:10.1109/TC.1982.1675963

Application of information theory to sequential fault diagnosis

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

Department of Electrical Engineering & Computer Science

Research output: Contribution to journal › Article › peer-review

31 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 language	English (US)
Pages (from-to)	164-170
Number of pages	7
Journal	IEEE Transactions on Computers
Volume	C-31
Issue number	2
DOIs	https://doi.org/10.1109/TC.1982.1675963
State	Published - Feb 1982

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

Access to Document

10.1109/TC.1982.1675963

Cite this

@article{6130d34b53f8498384f4d7ee15cc48d5,

title = "Application of information theory to sequential fault diagnosis",

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.",

keywords = "Binary decision trees, fault diagnosis, fault location, fault-tolerant computing, information theory, sequential experiments",

author = "Varshney, {Pramod K.} and Hartmann, {Carlos R.P.} and {De Faria}, {Jamie M.}",

year = "1982",

month = feb,

doi = "10.1109/TC.1982.1675963",

language = "English (US)",

volume = "C-31",

pages = "164--170",

journal = "IEEE Transactions on Computers",

issn = "0018-9340",

publisher = "IEEE Computer Society",

number = "2",

}

TY - JOUR

T1 - Application of information theory to sequential fault diagnosis

AU - Varshney, Pramod K.

AU - Hartmann, Carlos R.P.

AU - De Faria, Jamie M.

PY - 1982/2

Y1 - 1982/2

N2 - 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.

AB - 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.

KW - Binary decision trees

KW - fault diagnosis

KW - fault location

KW - fault-tolerant computing

KW - information theory

KW - sequential experiments

UR - http://www.scopus.com/inward/record.url?scp=0020090653&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020090653&partnerID=8YFLogxK

U2 - 10.1109/TC.1982.1675963

DO - 10.1109/TC.1982.1675963

M3 - Article

AN - SCOPUS:0020090653

SN - 0018-9340

VL - C-31

SP - 164

EP - 170

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

IS - 2

ER -

Application of information theory to sequential fault diagnosis

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this