The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Characterization of Connection Assignment of Diagnosable Systems
IEEE Transactions on Computers
Polynomially Complete Fault Detection Problems
IEEE Transactions on Computers
A Theory of Diagnosability of Digital Systems
IEEE Transactions on Computers
An Approach to the Diagnosability Analysis of a System
IEEE Transactions on Computers
System Diagnosis and Redundant Tests
IEEE Transactions on Computers
On Models for Diagnosable Systems and Probabilistic Fault Diagnosis
IEEE Transactions on Computers
(t,k)-Diagnosis for Matching Composition Networks
IEEE Transactions on Computers
(t, k) - Diagnosis for Matching Composition Networks under the MM* Model
IEEE Transactions on Computers
An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems
IEEE Transactions on Computers
Determining the conditional diagnosability of k-ary n-cubes under the MM* model
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
| Hi-index | 14.99 |
In this paper we analyze the computational complexity of system diagnosis. We show that several problems for instantaneous and sequential fault diagnosis of systems are polynomially complete and that for single-loop systems these problems are solvable in polynomial time.