An Algorithm for Determining the Fault Diagnosability of a System
IEEE Transactions on Computers
The NP-completeness column: An ongoing guide
Journal of Algorithms
A Generalized Theory for System Level Diagnosis
IEEE Transactions on Computers
Diagnosis in hybrid fault situations under AIM and a unified t-characterization
Computers and Mathematics with Applications - Diagnosis and reliable design of VLSI systems
Sequential Diagnosability is Co-NP Complete
IEEE Transactions on Computers
Improved Diagnosability Algorithms
IEEE Transactions on Computers
System-level fault diagnosis and reconfiguration
System-level fault diagnosis and reconfiguration
| Hi-index | 14.98 |
R. Gupta and I.V. Ramakrishnan (1987) proposed a general model for fault diagnosis that uniformly handles intermittent faults, masking, and partial testing. In this model, the diagnosability problem is open if asymmetric invalidation is used, although a polynomial time algorithm was once incorrectly claimed. It is shown that the problem is really co-NP complete. An efficient diagnosis algorithm for this model is presented.