Issue No.12 - December (2008 vol.57)
Sun-Yuan Hsieh , National Cheng Kung University, Tainan
Yu-Shu Chen , National Cheng Kung University, Tainan
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2008.104
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.
Diagnostics, Topology, Diagnostics, Graph Theory, Network problems
Sun-Yuan Hsieh, Yu-Shu Chen, "Strongly Diagnosable Systems under the Comparison Diagnosis Model", IEEE Transactions on Computers, vol.57, no. 12, pp. 1720-1725, December 2008, doi:10.1109/TC.2008.104