Almost sure fault tolerance in random graphs
SIAM Journal on Computing
Built-In Testing of Integrated Circuit Wafers
IEEE Transactions on Computers
Distributed Diagnosis Algorithms for Regular Interconnected Structures
IEEE Transactions on Computers
Efficient Diagnosis of Multiprocessor Systems Under Probabilistic Models
IEEE Transactions on Computers
A Diagnosis Algorithm for Constant Degree Structures and Its Application to VLSI Circuit Testing
IEEE Transactions on Parallel and Distributed Systems
A Graph Partitioning Approach to Sequential Diagnosis
IEEE Transactions on Computers
Almost Sure Diagnosis of Almost Every Good Element
IEEE Transactions on Computers
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
Evaluation of a Diagnosis Algorithm for Regular Structures
IEEE Transactions on Computers
Diagnosability of regular systems
Journal of Algorithms
Worst-Case Diagnosis Completeness in Regular Graphs under the PMC Model
IEEE Transactions on Computers
International Journal of Parallel, Emergent and Distributed Systems
Conditional diagnosability of alternating group networks
Information Processing Letters
| Hi-index | 0.01 |
The problem of fault diagnosis in grid-connected systems is considered. A diagnosis algorithm, called DAGS and based on the PMC model, is presented. DAGS provides a diagnosis which is shown to be correct, although possibly incomplete, if the cardinality of the actual fault set is below a bound Tσ, dependent of the actual syndrome σ. A bound T independent of σ is also derived by a worst-case analysis covering the cases of triangular, square, hexagonal and octagonal grids. T is shown to be θ(n2/3), where n is the size of the system, for all the grids considered.