By Topic

Strongly Diagnosable Systems under the Comparison Diagnosis Model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sun-Yuan Hsieh ; Dept. of''Comput. Sci. & Inf. Eng., Nat. Cheng Kung Univ., Tainan ; Yu-Shu Chen

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.

Published in:

Computers, IEEE Transactions on  (Volume:57 ,  Issue: 12 )