Diagnosability is an important metric to fault tolerance and reliability for multiprocessor systems. However, plenty of research on fault diagnosability focuses on node failure. In practical scenario, not only node failures take place but also link malfunctions may arise. In this work, we investigate the diagnosability of general regular networks with failing nodes as well as missing malfunctional links. Let |$S$| be a set of the missing links and broken-down nodes. We first prove that the diagnosability of the survival graph |$G\setminus S$| persists |$\delta (G\setminus S)$| under the PMC model (Preparata, F.P., Metze, G. and Chien, R.T. (1967) On the connection assignment problem of diagnosable systems. IEEE Trans. Electron. Comput., EC-16, 848–854) for a |$t$|-regular and |$t$|-connected triangle-free network |$G$| subject to |$|S|\leq t-1$| and |$|V(G)|\geq 3t-2$| (⁠|$t\geq 3$|⁠). Furthermore, we determine the diagnosability of |$G\setminus S$| for some kinds of extensively explored |$t$|-regular networks with triangles subject to |$|S|\leq t-1$| (⁠|$t\geq 3$|⁠).

中文翻译：

---

测试诊断模型下规则网络混合可诊断性的持久性

可诊断性是衡量多处理器系统的容错性和可靠性的重要指标。但是，有关故障可诊断性的大量研究都集中在节点故障上。在实际情况下，不仅会发生节点故障，而且还会出现链路故障。在这项工作中，我们调查具有故障节点以及缺少故障链接的常规网络的可诊断性。令| $ S $ | 是一组缺少的链接和故障节点。我们首先证明生存图的可诊断性| $ G \ setminus S $ | 持续| $ \ delta（G \ setminus S）$ | 在PMC模型下（Preparata，FP，Metze，G.和Chien，RT（1967）关于可诊断系统的连接分配问题。IEEETrans。Electron。Comput。，EC-16，848–854）| | $ t $ | -常规和| $ t $ | 连接的无三角形网络| $ G $ | 取决于| $ | S | \ leq t-1 $ | 和| $ | V（G）| \ geq 3t-2 $ | （⁠| $ t \ geq 3 $ |⁠）。此外，我们确定| $ G \ setminus S $ |的可诊断性。对于某些种类的广泛探索的| $ T $ | |||||| leq t-1 $ |的三角形的非规则网络 （⁠| $ t \ geq 3 $ |⁠）。