By Topic

Comments on "An O(n/sup 2.5/) fault identification algorithm for diagnosable systems"

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Radoytchevsky, V.T. ; Inst. of Sci. Res in Telecommun., Sofia, Bulgaria ; Shalaev, A.J.

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

Published in:

Computers, IEEE Transactions on  (Volume:43 ,  Issue: 2 )