By Topic

Improved diagnosability algorithms

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)
Raghavan, V. ; Dept. of Comput. Sci., Vanderbilt Univ., Nashville, TN, USA ; Tripathi, A.R.

The concepts of the PMC and BGM self-diagnosing system models of F. P. Preparata et al. (1967) and F. Barsi et al. (1976), respectively, including the notions of fault sets, consistency, and diagnosability number, are reviewed. Two one-step diagnosability algorithms are applied, one to the PMC model and the other to the BGM model. In both models, one-step diagnosability refers to a system's ability to determine all the faulty units from single collection of test results. Using the letters n, m, and τ to denote the number of units, the number of tests, and the diagnosability number, respectively, it is shown that in the BGM model the algorithm has a complexity of O(nτ2/log τ), and, in the PMC model, the algorithm has a complexity of O(nτ2.5)

Published in:

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