This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Fault Identification in Diagnosable Systems
June 1981 (vol. 30 no. 6)
pp. 414-422
null Kyung-Yong Chwa, Northwestern University, Evanston, IL. He is now with the Department of Computer Science, Korea Advanced Institute of Science
This paper begins by giving a characterization of t1/ t1?diagnosable systems. Then a class of t0-diagnosable systems, denoted by d(n,t0,X), is considered. It is shown for any member of this class that: 1) necessary and sufficient conditions for t1/t1?diagnosability are greatly simplified, 2) optimal diagnosis algorithms of time complexity 0(nt0) exist, and most importantly, 3) given the test results, any set F of faults with |F| = t1 can be identified to within a set F' with F ? F' and |F'| = min {t1, |F| + 1}.
Index Terms:
t-diagnosable systems, Characterization of t/t-diagnosable systems, diagnosis algorithms, digraph model, fault diagnosis, system diagnosis
Citation:
null Kyung-Yong Chwa, S.L. Hakimi, "On Fault Identification in Diagnosable Systems," IEEE Transactions on Computers, vol. 30, no. 6, pp. 414-422, June 1981, doi:10.1109/TC.1981.1675807
Usage of this product signifies your acceptance of the Terms of Use.