Strongly Diagnosable Systems under the Comparison Diagnosis Model

Authors:
Sun-Yuan Hsieh;Yu-Shu Chen
Affiliations:
National Cheng Kung University, Tainan;National Cheng Kung University, Tainan
Venue:
IEEE Transactions on Computers
Year:
2008

Citing 0
Cited 8

A survey of comparison-based system-level diagnosis

ACM Computing Surveys (CSUR)
Determining the conditional diagnosability of k-ary n-cubes under the MM* model

SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Diagnosability of star graphs with missing edges

Information Sciences: an International Journal
A general technique to establish the asymptotic conditional diagnosability of interconnection networks

Theoretical Computer Science
Conditional Diagnosability of k-Ary n-Cubes under the PMC Model

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Conditional diagnosability of matching composition networks under the MM* model

Information Sciences: an International Journal
An efficient fault detection and diagnosis protocolfor vehicular networks

Proceedings of the third ACM international symposium on Design and analysis of intelligent vehicular networks and applications
MoDiVHA: A Hierarchical Strategy for Distributed Test Assignment

Journal of Electronic Testing: Theory and Applications

Quantified Score

Hi-index	14.98

Visualization

Abstract

A system is $t$-diagnosable if all faulty nodes can be identified without replacement when the number of faults does not exceed $t$, where $t$ is some positive integer. Furthermore, a system is strongly $t$-diagnosable if it is $t$-diagnosable and can achieve $(t+1)$-diagnosable except for the case where a node's neighbors are all faulty. In this paper, we propose some conditions for verifying whether a class of interconnection networks, called Matching Composition Networks (MCNs), are strongly diagnosable under the comparison diagnosis model.