A comparison connection assignment for diagnosis of multiprocessor systems
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
Characterization of Connection Assignment of Diagnosable Systems
IEEE Transactions on Computers
A Theory of Diagnosability of Digital Systems
IEEE Transactions on Computers
Diagnosis of Systems with Asymmetric Invalidation
IEEE Transactions on Computers
Greedy Diagnosis as the Basis of an Intermittent-Fault/ Transient-Upset Tolerant System Design
IEEE Transactions on Computers
An Approach to the Diagnosability Analysis of a System
IEEE Transactions on Computers
A Polynomial Time Algorithm For Fault Diagnosability
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
A Diagnosis Algorithm for the BGM System Level Fault Model
IEEE Transactions on Computers
Sequential Diagnosability is Co-NP Complete
IEEE Transactions on Computers
Improved Diagnosability Algorithms
IEEE Transactions on Computers
On Asymmetric Invalidation with Partial Tests
IEEE Transactions on Computers
IEEE Transactions on Computers
On Single-Fault Set Diagnosability in the PMC Model
IEEE Transactions on Computers
| Hi-index | 15.00 |
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.