Almost sure fault tolerance in random graphs
SIAM Journal on Computing
A O(t3+ |E| ) Fault Identification Algorithm for Diagnosable Systems
IEEE Transactions on Computers - Fault-Tolerant Computing
Built-In Testing of Integrated Circuit Wafers
IEEE Transactions on Computers
Sequential Diagnosability is Co-NP Complete
IEEE Transactions on Computers
Efficient Diagnosis of Multiprocessor Systems Under Probabilistic Models
IEEE Transactions on Computers
A Graph Partitioning Approach to Sequential Diagnosis
IEEE Transactions on Computers
Correct and Almost Complete Diagnosis of Processor Grids
IEEE Transactions on Computers
Almost Sure Diagnosis of Almost Every Good Element
IEEE Transactions on Computers
Evaluation of a Diagnosis Algorithm for Regular Structures
IEEE Transactions on Computers
Fault-diagnosis of grid structures
Theoretical Computer Science - Dependable computing
Diagnosis of Regular Structures
DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
Diagnosability of regular systems
Journal of Algorithms
Self diagnosis of processor arrays using a comparison model
SRDS '95 Proceedings of the 14TH Symposium on Reliable Distributed Systems
Characterization of Connection Assignment of Diagnosable Systems
IEEE Transactions on Computers
An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems
IEEE Transactions on Computers
A Theory of Diagnosability of Digital 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
Fault isolation and identification in general biswapped networks under the PMC diagnostic model
Theoretical Computer Science
| Hi-index | 14.98 |
System-level diagnosis aims at the identification of faulty units in a system by the analysis of the system syndrome, that is, the outcomes of a set of interunit tests. For any given syndrome, it is possible to produce a correct (although possibly incomplete) diagnosis of the system if the number of faults is below a syndrome-dependent bound and the degree of diagnosis completeness, that is, the number of correctly diagnosed units, is also dependent on the actual syndrome \sigma. The worst-case diagnosis completeness is a syndrome-independent bound that represents the minimum number of units that the diagnosis algorithm correctly diagnoses for any syndrome. This paper provides a lower bound to the worst-case diagnosis completeness for regular graphs for which vertex-isoperimetric inequalities are known and it shows how this bound can be applied to toroidal grids. These results prove a previous hypothesis about the influence of two topological parameters of the diagnostic graph, that is, the bisection width and the diameter, on the degree of diagnosis completeness.