An Algorithm for Determining the Fault Diagnosability of a System
Narasimhan, Nakajima · IEEE Transactions on Computers · 1986
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.