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
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Graph Theory With Applications
Graph Theory With Applications
Sequential Diagnosability is Co-NP Complete
IEEE Transactions on Computers
Distributed Diagnosis Algorithms for Regular Interconnected Structures
IEEE Transactions on Computers
On Parallel Algorithms for Single-Fault Diagnosis in Fault Propagation Graph Systems
IEEE Transactions on Parallel and Distributed Systems
Expected-Value Analysis of Two Single Fault Diagnosis Algorithms
IEEE Transactions on Computers
Computational Complexity Issues in Operative Diagnostics of Graph-Based Systems
IEEE Transactions on Computers
On Single-Fault Set Diagnosability in the PMC Model
IEEE Transactions on Computers
| Hi-index | 15.00 |
The complexity of the single-fault (SF) set diagnosability and SF-diagnosis problems under the symmetric invalidation models is discussed. It is shown that the SF-diagnosis problem under both these models is co-NP-complete and the SF-diagnosability problem is also co-NP-complete under the asymmetric invalidation model. The SF-diagnosability problem is also studied under the symmetric-invalidation model and a polynomial time-complexity algorithm is presented. These results are in contrast with the corresponding t-diagnosability and t-diagnosis problems, which are known to have polynomial time-complexity algorithms.