The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (1986 vol.35)
pp: 1004-1008
J. Narasimhan , Burroughs Corporation
ABSTRACT
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.
INDEX TERMS
test links, Connection assignment, diagnosable systems, fault diagnosis, self-diagnosis, system diagnosability
CITATION
J. Narasimhan, K. Nakajima, "An Algorithm for Determining the Fault Diagnosability of a System", IEEE Transactions on Computers, vol.35, no. 11, pp. 1004-1008, November 1986, doi:10.1109/TC.1986.1676703
49 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool