On t-diagnosable systems and their implications in fault tolerant computing
On t-diagnosable systems and their implications in fault tolerant computing
Graph Theory With Applications
Graph Theory With Applications
Characterization of Connection Assignment of Diagnosable Systems
IEEE Transactions on Computers
Universal System Diagnosis Algorithms
IEEE Transactions on Computers
Diagnosable Systems for Intermittent Faults
IEEE Transactions on Computers
IEEE Transactions on Computers
An Efficient Fault Diagnosis Algorithm for Symmetric Multiple Processor Architectures
IEEE Transactions on Computers
A fault identification algorithm for ti-diagnosable systems
IEEE Transactions on Computers - The MIT Press scientific computation series
On Fault Isolation and Identification in t1/t1-Diagnosable Systems
IEEE Transactions on Computers
Optimal Diagnosable System Design Using Full-Difference Triangles
IEEE Transactions on Computers
A Generalized Theory for System Level Diagnosis
IEEE Transactions on Computers
Algorithms for finding diagnosability level and t-diagnosis in a network of processors
ACM '82 Proceedings of the ACM '82 conference
IEEE Transactions on Computers
An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems
IEEE Transactions on Computers
Diagnosis in the Presence of Known Faults
IEEE Transactions on Computers
An Efficient Approach for Fault Diagnosis in a Boolean n-Cube Array of Microprocessors
IEEE Transactions on Computers
Efficient Fault Identification of Diagnosable Systems under the Comparison Model
IEEE Transactions on Computers
On conditional diagnosability of the folded hypercubes
Information Sciences: an International Journal
International Journal of Parallel, Emergent and Distributed Systems
Diagnosability of Two-Matching Composition Networks
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model
Information Sciences: an International Journal
Conditional diagnosability of alternating group networks
Information Processing Letters
On t-diagnosability of multicore systems with symmetric circulant structure
Automation and Remote Control
Conditional diagnosability of matching composition networks under the MM* model
Information Sciences: an International Journal
Fault diagnosability of arrangement graphs
Information Sciences: an International Journal
Fault isolation and identification in general biswapped networks under the PMC diagnostic model
Theoretical Computer Science
| Hi-index | 15.01 |
This paper begins by giving a characterization of t1/ t1 diagnosable systems. Then a class of t0-diagnosable systems, denoted by d(n,t0,X), is considered. It is shown for any member of this class that: 1) necessary and sufficient conditions for t1/t1 diagnosability are greatly simplified, 2) optimal diagnosis algorithms of time complexity 0(nt0) exist, and most importantly, 3) given the test results, any set F of faults with |F| = t1 can be identified to within a set F' with F ? F' and |F'| = min {t1, |F| + 1}.