Number of mutual connections in neighborhoods and its application to self-diagnosable systems

DOI10.1016/S0020-0190(03)00363-6zbMath1178.68093OpenAlexW2094931919MaRDI QIDQ1028988

Tohru Kohda, Yasumasa Sujaku, Kiyoaki Yoshida

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(03)00363-6

zbMATH Keywords

fault tolerancePMC modelsystem-level diagnosis\(d\)-regular graphshighly structured systemone-step \(t\)-fault diagnosable system

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• On Models for Diagnosable Systems and Probabilistic Fault Diagnosis
• Characterization of Connection Assignment of Diagnosable Systems
• On Representatives of Subsets
• Optimization of Reduced Dependencies for Synchronous Sequential Machines

This page was built for publication: Number of mutual connections in neighborhoods and its application to self-diagnosable systems