An Efficient Algorithm for Identifying the Most Likely Fault Set in a Probabilistically Diagnosable System
Issue No. 04 - April (1986 vol. 35)
A.T. Dahbura , AT&T Bell Laboratories
An O(n<sup>3</sup>) algorithm is given for determining the most likely set of faulty processors in a class of systems introduced by Maheshwari and Hakimi, known as probabilistically diagnosable systems. The technique uses the a priori probability of failure of each unit combined with the results of tests which the processors administer to one another to perform diagnosis. The algorithm uses wel
vertex cover set, Diagnosis, fault tolerance, multiprocessor systems, probabilistic diagnosability
A. Dahbura, "An Efficient Algorithm for Identifying the Most Likely Fault Set in a Probabilistically Diagnosable System," in IEEE Transactions on Computers, vol. 35, no. , pp. 354-356, 1986.