This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Comments on "An O(n/sup 2.5/) Fault Identification Algorithm for Diagnosable Systems
February 1994 (vol. 43 no. 2)
pp. 254-255

For original paper see A.T. Dahbura and G.M. Masson, "An O(n/sup 2.5/) fault identification algorithm for diagnosable systems," IEEE Trans. Comput., vol. C-33, pp. 486-492, Jun. 1984. Dahbura and Masson suggested an alternative version of Hakimi-Amin's theorem about the necessary and sufficient conditions for the system, described by PMC model (1967), to be t/sub p/-diagnosable. The authors found systems with connection assignment that satisfy conditions of Dahbura-Masson's theorem but are not t/sub p/-diagnosable. In this correspondence they state the additional condition under which Dahbura-Masson's theorem will hold.

[1] A. T. Dahbura and G.M. Masson, "An O(n2.5) fault identification algorithm for diagnosable systems,"IEEE Trans. Comput., vol. C-33, pp. 486-492, Jun. 1984.
[2] S. L. Hakimi and A.T. Amin, "Characterization of the connection assignment of diagnosable systems,"IEEE Trans. Comput., vol. C-23, pp. 86-88, Jan. 1974.
[3] F. P. Preparata, G. Metze, and R. T. Chien, "On the connection assignment problem of diagnosable systems,"IEEE Trans. Electron. Comput., vol. EC-16, pp. 848-854, Dec. 1967.

Index Terms:
fault tolerant computing; distributed processing; computational complexity; fault identification algorithm; diagnosable systems; connection assignment; diagnosable system; graph models; permanent fault; PMC model; system-level faults; distributed computed architectures.
Citation:
V.Tz. Radoytchevsky, A.Ja.. Shalaev, "Comments on "An O(n/sup 2.5/) Fault Identification Algorithm for Diagnosable Systems," IEEE Transactions on Computers, vol. 43, no. 2, pp. 254-255, Feb. 1994, doi:10.1109/12.262134
Usage of this product signifies your acceptance of the Terms of Use.