Graph Theory With Applications
Graph Theory With Applications
Characterization of Connection Assignment of Diagnosable Systems
IEEE Transactions on Computers
On Fault Identification in Diagnosable Systems
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 Characterization of t/s-Diagnosability and Sequential t-Diagnosability in Designs
IEEE Transactions on Computers
Diagnosabilities of Hypercubes Under the Pessimistic One-Step Diagnosis Strategy
IEEE Transactions on Computers
The consensus problem in fault-tolerant computing
ACM Computing Surveys (CSUR)
On Diagnosability of Large Fault Sets in Regular Topology-Based Computer Systems
IEEE Transactions on Computers
Diagnosability of the Möbius Cubes
IEEE Transactions on Parallel and Distributed Systems
Multiprocessor Fault Diagnosis Under Local Constraints
IEEE Transactions on Computers
Diagnosability of Enhanced Hypercubes
IEEE Transactions on Computers
Adaptive Unanimous Voting (UV) Scheme for Distributed Self-Diagnosis
IEEE Transactions on Computers
(t, k)-Diagnosable System: A Generalization of the PMC Models
IEEE Transactions on Computers
A fast pessimistic one-step diagnosis algorithm for hypercube multicomputer systems
Journal of Parallel and Distributed Computing
The t/k-Diagnosability of the BC Graphs
IEEE Transactions on Computers
Diagnosabilities of Regular Networks
IEEE Transactions on Parallel and Distributed Systems
A (4n-9)/3 diagnosis algorithm on n-dimensional cube network
Information Sciences: an International Journal
Efficient Fault Identification of Diagnosable Systems under the Comparison Model
IEEE Transactions on Computers
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
Fault diagnosis for hypercube-like networks
AICT'11 Proceedings of the 2nd international conference on Applied informatics and computing theory
Conditional diagnosability of matching composition networks under the MM* model
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 |
Consider a classical PMC system composed of n units [1] where it is assumed that at most t1 of these units are faulty. Such a system is said to be t1/t1-diagnosable [3] if, given any complete collection of test results, the set of faulty units can be isolated to within a set of at most t1 units. This paper exposes some new, important properties of general t1/t1-diagnosable systems to present an O(n2.5) algorithm by which all the faulty units except at most one can be correctly identified and all the faulty units can be isolated to within a set of t1 or fewer units in which at most one can possibly be fault free.