The author reformulates the theory of diagnosis given by R. Reiter (see Artificial Intelligence vol.32, no.1, p.57-95, 1987) in a systems theory framework and extends it to explicitly cover admissible fault models. The reformulation allows one to use straightforward set theoretic and algebraic concepts to characterize the main theorem relating diagnoses and conflict sets. The authors distinguish between weak and strong diagnoses and show that nonminimal strong diagnoses (multiple faults) may arise where the class of admissible fault models of components is restricted. They argue that the effectiveness of troubleshooting may be greatly enhanced by taking such diagnoses into account. This is true since the nature of the admissible fault model classes can dramatically affect the diagnoses generated. In particular, diagnoses that are not based on models of potential fault behaviors may be quite deceptive in relation to actual failed system behavior. The full family of strong diagnoses, although potentially much more computationally demanding than the minimal diagnoses, should be taken as the basis for troubleshooting. >
[1]
Russell Greiner,et al.
A Correction to the Algorithm in Reiter's Theory of Diagnosis
,
1989,
Artif. Intell..
[2]
Donald A. Waterman,et al.
A Guide to Expert Systems
,
1986
.
[3]
Brian C. Williams,et al.
Diagnosing Multiple Faults
,
1987,
Artif. Intell..
[4]
Ethan A. Scarl,et al.
Diagnostic tolerance for missing sensor data
,
1989
.
[5]
C. Desoer,et al.
Linear System Theory
,
1963
.
[6]
Randall Davis,et al.
Diagnostic Reasoning Based on Structure and Behavior
,
1984,
Artif. Intell..
[7]
Michael R. Genesereth,et al.
The Use of Design Descriptions in Automated Diagnosis
,
1984,
Artif. Intell..
[8]
Raymond Reiter,et al.
A Theory of Diagnosis from First Principles
,
1986,
Artif. Intell..
[9]
B.P. Zeigler,et al.
Symbolic discrete event system specification
,
1992,
IEEE Trans. Syst. Man Cybern..