Built-In Testing of Integrated Circuit Wafers
IEEE Transactions on Computers
Sequential Diagnosability is Co-NP Complete
IEEE Transactions on Computers
A Graph Partitioning Approach to Sequential Diagnosis
IEEE Transactions on Computers
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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)
CorrectandAlmostCompleteDiagnosisofProcessorGrids
CorrectandAlmostCompleteDiagnosisofProcessorGrids
Reducing the Number of Sequential Diagnosis Iterations in Hypercubes
IEEE Transactions on Computers
A fast pessimistic one-step diagnosis algorithm for hypercube multicomputer systems
Journal of Parallel and Distributed Computing
Diagnosabilities of Regular Networks
IEEE Transactions on Parallel and Distributed Systems
Minimum neighborhood in a generalized cube
Information Processing Letters
(t, k) - Diagnosis for Matching Composition Networks under the MM* Model
IEEE Transactions on Computers
Worst-Case Diagnosis Completeness in Regular Graphs under the PMC Model
IEEE Transactions on Computers
International Journal of Parallel, Emergent and Distributed Systems
On diagnosability of large multiprocessor networks
Discrete Applied Mathematics
Interactive Communication, Diagnosis and Error Control in Networks
Algorithmics of Large and Complex Networks
One-step t-fault diagnosis for hypermesh optical interconnection multiprocessor systems
Journal of Systems and Software
Minimum neighborhood in a generalized cube
Information Processing Letters
Conditional diagnosability of alternating group networks
Information Processing Letters
| Hi-index | 0.01 |
A novel approach aimed at evaluating the diagnosability of regular systems under the PMC model is introduced. The diagnosability is defined as the ability to provide a correct diagnosis, although possibly incomplete. This concept is somehow intermediate between one-step diagnosability and sequential diagnosability. A lower bound to diagnosability is determined by lower bounding the minimum of a "syndrome-dependent" bound tσ over the set of all the admissible syndromes. In turn, tσ is determined by evaluating the cardinality of the smallest consistent fault set containing an aggregate of maximum cardinality. The new approach, which applies to any regular system, relies on the "edge-isoperimetric inequalities" of connected components of units declaring each other nonfaulty. This approach has been used to derive tight lower bounds to the diagnosability of toroidal grids and hypercubes, which improve the existing bounds for the same structures.