摘要
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.
原文 | English |
---|---|
頁(從 - 到) | 1720-1725 |
頁數 | 6 |
期刊 | IEEE Transactions on Computers |
卷 | 57 |
發行號 | 12 |
DOIs | |
出版狀態 | Published - 2008 |
All Science Journal Classification (ASJC) codes
- 軟體
- 理論電腦科學
- 硬體和架構
- 計算機理論與數學