The Community for Technology Leaders
Green Image
Issue No. 11 - November (1986 vol. 35)
ISSN: 0018-9340
pp: 1004-1008
J. Narasimhan , Burroughs Corporation
The fault diagnosability problem is the problem of computing the maximum number of faulty units which a system can tolerate without losing its capability of identifying all such faulty units. We study this problem for the model introduced by Barsi, Grandoni, and Maestrini [2]. We present a new characterization of the model, and develop an efficient diagnosability algorithm for a system in this model.
test links, Connection assignment, diagnosable systems, fault diagnosis, self-diagnosis, system diagnosability

K. Nakajima and J. Narasimhan, "An Algorithm for Determining the Fault Diagnosability of a System," in IEEE Transactions on Computers, vol. 35, no. , pp. 1004-1008, 1986.
80 ms
(Ver 3.3 (11022016))