t/k-Diagnosability of Regular Networks under the Comparison Model

Abstract

As multiprocessor systems continue to grow in processor scale, the incidence of faults also increases. As a result, fault diagnosis is becoming a key mechanism for maintaining the normal operation of multiprocessor systems. To explore more effective diagnostic methods, Somani et al. introduced a generalized pessimistic diagnostic strategy, named $t/k$-diagnosis, in which all faulty nodes are isolated in a set of nodes and at most k fault-free nodes are misdiagnosed, provided that the quantity of faults is limited by t. By imposing certain conditions or restrictions, the $t/k$-diagnosability of some regular networks under the Preparata, Metze, and Chien (PMC) model has been determined. However, the $t/k$-diagnosability of many networks under the comparison model remains unidentified. In this paper, we provide new insights into the study of $t/k$-diagnosability under the comparison model. After introducing some new notions, such as the 0-test unit, 0-test set and 0-test subgraph, under the comparison model, we study the relationship in a system G between the 0-test subgraphs and the components of $G-F$, where F is the set of faulty nodes, and we obtain some important correlation properties. Based on these results, we study $t/k$-diagnosability under the comparison model. As a result, the $t/k$-diagnosability of some regular interconnection networks can be efficiently determined.

1. Introduction

With the rapid advancement of information technology, the precision of very large-scale integration (VLSI) is becoming increasingly sophisticated. Today’s supercomputers may have thousands of processors. Take the US supercomputer Summit, which was crowned the world’s fastest super computer in 2018 and 2019, for example; it has 9216 processors. The large scale of its processor numbers may cause many unreliability problems. Therefore, reliability is an important issue to consider in the design, operation, and maintenance of such a large-scale multiprocessor system. To maintain system reliability, it is necessary to quickly identify all faults. The procedure of recognizing faults is known as fault diagnosis. System-level diagnosis is considered an ideal fault diagnostic method [1].

Many important diagnostic strategies have been proposed in the course of the development of system-level fault diagnosis theory. Among them, the diagnostic capability of the original diagnostic strategy introduced by Preparata et al. [1], named t-diagnosis, is relatively weak. To improve the diagnostic capability, another important diagnostic strategy, called $t/k$-diagnosis [2], which requires all faulty nodes to be isolated in a set of nodes, was proposed by Somani et al. In this approach, at most k nodes can be misdiagnosed if the fault node number does not exceed t. For the system G, its $t/k$-diagnosability is the maximum value of t satisfying the condition that G is $t/k$-diagnosable. For example, the hypercube is an important network topology, which has been applied to many parallel and distributed systems such as iWarp [3] and Cray T3D [4]. For $n⩾4$ and $n⩾k⩾1$, it is proved by Somani et al. [2] that the hypercube $Q_n$ is $[(k+1)n-\frac{(k+1)(k+2)}{2}+1]/k$-diagnosable. The $t/k$-diagnosability of several networks under the PMC model has been determined, including hypercubes [2], star graphs [2,5], mesh-based systems [2], and bijective connection (BC) networks [6,7]. Recently, by utilizing the properties of the 0-test subgraph under the PMC model, Lin et al. [8] studied the $t/k$-diagnosability of regular graphs under the PMC model.

It is well known that there are three system-level diagnosis models: the BGM model [9], the comparison model [10], and the PMC model. The BGM model is not often used in the existing literature as a fault diagnosis model due to its flaws. It is worth mentioning as Sengupta and Dahbura state[10], the comparison diagnosis model can be obtained by generalizing the PMC model. In other words, in terms of diagnosis model, the comparison model is often more suitable than the PMC model for studying the system fault diagnosis. However, to the best of our knowledge, to date, few studies have investigated $t/k$-diagnosability under the comparison model. In this paper, we study the problem of $t/k$-diagnosability for regular networks under the comparison model.

The main contributions of this paper are described below.

• To study $t/k$-diagnosability based on the comparison model, the paper introduces some important definitions, such as the 0-test unit and 0-test subgraph, and present their related properties;
• We present the description of the $t/k$-diagnosability of regular networks under the comparison model. At the same time, we propose a $t/k$-diagnosis algorithm for regular networks under the comparison model, which is, to the best of our knowledge, the first such $t/k$-diagnosis algorithm for regular networks under the comparison model;
• We give the $t/k$-diagnosabilities for some famous network systems such as hypercube networks, star networks, complete cubic networks, and so on.

The rest of the paper is organized as follows. In the following section, some necessary terminologies and notations are presented. We introduce the definition and properties of the 0-test subgraph in Section 3. Section 4 presents the main results of this paper. We discuss some applications in Section 5. Section 6 concludes the paper.

2. Preliminaries

A multiprocessor system can be modeled as a graph $G(V,E)$, with $V\left(G\right)$ being the node set and $E\left(G\right)$ being the edge set. For $x\in V\left(G\right)$, $N\left(x\right)$ is the set of all the neighbors of x, and ${deg}_G\left(x\right)$ is the degree of x in G. Let $\Delta \left(G\right)={\displaystyle \underset{x\in V\left(G\right)}{max}}deg\left(x\right)$ and $\delta \left(G\right)={\displaystyle \underset{x\in V\left(G\right)}{min}}deg\left(x\right)$. Then, $N\left(A\right)={\displaystyle \bigcup _{x\in A}}N\left(x\right)-A$ and $N_B\left(A\right)=N\left(A\right)\cap B$, where $A\subset V\left(G\right)$ and $B\subset V\left(G\right)$.

In a connected graph, nodes with degree 1 are known as pendant nodes. A pendant edge is incident to at least one pendant node. Then, all the nodes and edges in G can be classified into two types: pendant and non-pendant. Let $V_1\left(G\right)$ and $V_2\left(G\right)$ be the sets of pendant nodes and non-pendant nodes, and let $E_1\left(G\right)$ and $E_2\left(G\right)$ be the sets of pendant edges and non-pendant edges, respectively, (see Figure 1). Then, we have the following properties.

Lemma 1.

If G is a connected graph with $\left|V\right(G\left)\right|\ge 3$, then $|E_1\left(G\right)|=|V_1\left(G\right)|$.

Proof of Lemma 1.

Since G is connected with $\left|V\right(G\left)\right|\ge 3$, there exist no edges whose two endpoints are pendant nodes. That is, each pendant edge corresponds to a different pendant node (see Figure 1). Therefore, $|E_1\left(G\right)|=|V_1\left(G\right)|$.    □

Lemma 2.

$G-V_1\left(G\right)$ is connected.

Proof of Lemma 2.

For any two nodes $x,y\in V_2\left(G\right)$, since G is connected, there exists a path that connects x and y (see Figure 2). Since each node in $V_1\left(G\right)$ has degree 1, the path will not pass through any node in $V_1\left(G\right)$. Thus, there is a path that connects x and y in $G-V_1\left(G\right)$. Therefore, $G-V_1\left(G\right)$ is connected.    □

Lemma 3.

Let $G=(V,E)$ be a connected graph satisfying $\left|V\right|\ge 3$ and $\Delta \left(G\right)\ge 2$. Then, $|V_2\left(G\right)|\ge \frac{\left|V\right(G\left)\right|-2}{\Delta \left(G\right)-1}$.

Proof of Lemma 3.

We have $V_1\left(G\right)=V\left(G\right)-V_2\left(G\right)$. By Lemma 2, $G-V_1\left(G\right)$ is connected. That is, all nodes in $V_2\left(G\right)$ are connected by edges in $E_2$. Clearly, $|E_2|\ge |V_2|-1$. Assume the average degree in $V_2$ is a with $2\le a\le \Delta \left(G\right)$. By Lemma 1, $|E_1\left(G\right)|=|V_1\left(G\right)|$. According to Euler’s handshaking lemma, we have

$$\begin{array}{c}|V_1\left(G\right)|+a|V_2\left(G\right)|=2(|E_1\left(G\right)|+|E_2\left(G\right)\left|\right)\hfill \\ \Rightarrow |V_1\left(G\right)|+a|V_2\left(G\right)|\ge 2(|V_1\left(G\right)|+|V_2\left(G\right)|-1)\hfill \\ \Rightarrow (a-2)|V_2\left(G\right)|\ge |V_1\left(G\right)|-2\hfill \\ \Rightarrow (a-2)|V_2\left(G\right)|\ge |V\left(G\right)|-|V_2\left(G\right)|-2\hfill \\ \Rightarrow |V_2\left(G\right)|\ge \frac{\left|V\right(G\left)\right|-2}{a-1}\ge \frac{\left|V\right(G\left)\right|-2}{\Delta \left(G\right)-1}.\hfill \end{array}$$

Therefore, $|V_2\left(G\right)|\ge \frac{\left|V\right(G\left)\right|-2}{\Delta \left(G\right)-1}$.    □

In system-level diagnosis, the PMC model [1] and comparison model [10] are two widely adopted diagnostic models. Under the comparison model, a comparator will distribute a task to its two adjacent nodes and compare the responses they provide. The comparison of nodes x and y performed by z is denoted by ${(x,y)}_z$, where $(z,x)$ and $(z,y)$ denote two test edges, respectively. The outcome of test ${(x,y)}_z$ is represented by $\sigma {(x,y)}_z$. In 

Table 1. Invalidation rules for the comparison model.

Comparator z	Tested Nodes x and y	$\mathit{\sigma }{(\mathit{x},\mathit{y})}_{\mathit{z}}$
Fault-free	Fault-free	0
Fault-free	At least one is faulty	1
Faulty	Any case	0 or 1

, the invalidation rules for the comparison model are summarized. By Table 1, if $\sigma {(x,y)}_z=0$, all three nodes are fault-free or the tester z is faulty. Moreover, if x and z are fault-free, we can identify y as fault-free by $\sigma {(x,y)}_z=0$ or as faulty by $\sigma {(x,y)}_z=1$.

A collection of all the test results is called a syndrome $\sigma$. For a given syndrome $\sigma$, F is called an allowable faulty set if $\sigma$ can be produced from F, i.e., if the following two conditions hold:

(a)

$\sigma {(x,y)}_z=0$ for $x,y,z\in V-F$;

(b)

$\sigma {(x,y)}_z=1$ for $z\in V-F$ and $x\in F$ (or $y\in F$).

For a given syndrome $\sigma$, if there are several allowable faulty sets $F_1,F_2,\dots ,F_r$, we cannot accurately diagnose the set. As a result, the faulty nodes can only be isolated into a set F, such that $F=F_1\cup F_2\cup \dots \cup F_r$.

3. 0-Test Subgraph under the Comparison Model

For a given a syndrome $\sigma$ under the comparison model, test ${(u,w)}_v$ is a 0-test unit if $\sigma {(u,w)}_v=0$, where $(u,v)$ and $(w,v)$ are two test edges. The two tests, ${(u,w)}_v$ and ${(v,x)}_w$, belong to the same 0-test set because they share at least one common test edge (see Figure 3). The graph induced by a 0-test set is called a 0-test subgraph.

For instance, we have $V\left(G\right)=\{a,b,c,d,e,f,g\}$ (see Figure 4). The syndrome under the comparison model is represented in Figure 4, where $\sigma {(b,c)}_a=0$, $\sigma {(a,c)}_b=0$, $\sigma {(a,b)}_c=0$, $\sigma {(b,e)}_c=0$, $\sigma {(a,e)}_c=0$, $\sigma {(c,e)}_d=0$, $\sigma {(g,b)}_f=0$, $\sigma {(b,e)}_f=0$, and $\sigma {(f,a)}_g=0$, and the outcomes of other tests are 1. Hence, there are nine 0-test units, ${(b,c)}_a$, ${(a,c)}_b$, ${(a,b)}_c$, ${(b,e)}_c$, ${(a,e)}_c$, ${(c,e)}_d$, ${(g,b)}_f$, ${(b,e)}_f$, and ${(f,a)}_g$. Furthermore, there are three 0-test sets, A={${(f,a)}_g$, ${(g,b)}_f$, ${(b,e)}_f$}, B={${(b,c)}_a$, ${(a,c)}_b$, ${(a,b)}_c$, ${(b,e)}_c$, ${(a,e)}_c$}, and C={${(c,e)}_d$} (see Figure 5). Then, let $I_A$, $I_B$, and $I_C$ be the 0-test subgraphs induced by 0-test sets A, B, and C, respectively, (see Figure 6). The set of all 0-test subgraphs of G is written as $T_0\left(G\right)=\{I_A,I_B,I_C\}$. For any $X\in T_0\left(G\right)$, $\left|V\right(X\left)\right|\ge 3$.

Let H be a 0-test set under the comparison model. Let $\tau \left(H\right)$ represent the set consisting all testers in H. Clearly, all the testers in H are connected in H or $\left|\tau \right(H\left)\right|=1$. In the previous example, we have $\tau \left(A\right)=\{g,f\}$, $\tau \left(B\right)=\{a,b,c\}$, and $\tau \left(C\right)=\left\{d\right\}$. Then, we have the following properties.

Lemma 4.

Let H be a 0-test set of G under the comparison model. Either all the nodes in H are fault-free or each node in $\tau \left(H\right)$ is faulty.

Proof of Lemma 4.

For arbitrary ${(b,c)}_a\in H$, $\sigma {(b,c)}_a=0$. By Table 1, all the nodes of a, b, and c are fault-free or tester a is faulty. Let ${(a,e)}_c$ be another 0-test unit in H that has a common test edge with ${(b,c)}_a$. We have $\sigma {(a,e)}_c=0$. If a, b, and c are fault-free, e is also fault-free because $\sigma {(a,e)}_c=0$. This process continues until all 0-test units in H have been examined. Therefore, all the nodes in H are fault-free. Otherwise, a is faulty, since $\sigma {(a,e)}_c=0$, c is also faulty by Table 1. As a result, all the nodes in $\tau \left(H\right)$ are faulty.    □

Lemma 5.

Assume that F represents a fault set of G. For any component C of $G-F$, C is a 0-test subgraph under the comparison model.

Proof of Lemma 5.

Since C is a component of $G-F$, C is connected, and all the nodes in C are fault-free with $N\left(C\right)\subseteq F$. Hence, under the comparison model, any test in C is a 0-test unit. Therefore, C belongs to a 0-test subgraph $S\in T_0\left(G\right)$. For any $x\in N\left(C\right)$, without loss of generality, suppose that $(x,z),(y,z)\in E\left(G\right)$ with $y,z\in V\left(C\right)$ (see Figure 7). Then, we have $\sigma {(x,y)}_z=1$. Hence, $x\notin V\left(S\right)$. That is, each node in $N\left(C\right)$ does not belong to S. Therefore, $C=S$.    □

Lemma 6.

Let S represent a 0-test subgrapht corresponding a component C of $G-F$ under the comparison model. Then, $\tau \left(S\right)=V_2\left(C\right)$.

Proof of Lemma 6.

Since C is connected and all the nodes in C are fault-free, we have $V_2\left(C\right)\subseteq \tau \left(S\right)$. For an arbitrary 0-test unit ${(x,y)}_a$ in S, tester a has at least two neighbors x and y in C. Thus, $a\in V_2\left(C\right)$. Then, we have $V_2\left(C\right)\supseteq \tau \left(S\right)$. Therefore, $V_2\left(C\right)=\tau \left(S\right)$.    □

Lemma 7.

Let F be a fault set of G and let $S\in T_0\left(G\right)$ with $\left|\tau \right(S\left)\right|>\left|F\right|$; then, S is a component of $G-F$.

Proof of Lemma 7.

Since $\left|\tau \right(S\left)\right|>\left|F\right|$, by Lemma 4, all the nodes in S are fault-free. Moreover, since S is a connected subgraph, S belongs to component C of $G-F$, denoted by $S\subseteq C$. Suppose that $S⊉C$. Since C is connected, $\exists x\in V\left(C\right)$ satisfying $x\in N\left(S\right)$ (see Figure 8). We let $y\in V\left(S\right)$ such that $x\in N\left(y\right)$. Since $S\in T_0\left(G\right)$, $\left|V\right(S\left)\right|\ge 3$. There exists another node $z\in N\left(y\right)$ with $z\in V\left(S\right)$. Furthermore, since C is a component of $G-F$, $x,y,z\notin F$. Thus, $\sigma {(x,z)}_y=0$. By the definition of the 0-test subgraph, $x\in V\left(S\right)$, which contradicts $x\in N\left(S\right)$. Therefore, $S=C$.    □

4. $t/k$-Diagnosability and a $t/k$-Diagnosis Algorithm under the Comparison Model

In the section, we discuss the $t/k$-diagnosability for a given regular network $G=(V,E)$. The outline of the section is as follows. First, we prove that for a fault set S with $\left|S\right|\le f\left(k\right)+1$ and $k\ge 0$, $G-S$ contains a large component H with $\left|V\right(H\left)\right|\ge \left|S\right|$ and the number of nodes in $G-S-H$ is no more than $k+1$ nodes. Next, we discuss the sufficient conditions for the result that G is $f\left(k\right)/k$-diagnosable under the comparison model. Finally, based on the obtained sufficient conditions and depth-first search strategy, we design a $t/k$-diagnosis algorithm for computing a fault set F with $\left|F\right|⩽t$ for the regular network G such that at most k free-fault nodes belong to F.

Suppose that $f\left(k\right)$ is a function of integer k with $k\ge 1$ and $k\le f\left(k\right)$; the following three conditions are used in the rest of this paper.

Condition 1.

For any $F\subset V\left(G\right)$ with $\left|F\right|\le f\left(k\right)$, $G-F$ contains a large component H such that $\left|V\right(H\left)\right|\ge \left|V\right(G\left)\right|-\left|F\right|-k$ and $\left|V\right(H\left)\right|\ge \left|F\right|$;

Condition 2.

$\left|V\right(G\left)\right|\ge \Delta \left(G\right)f\left(k\right)+\Delta \left(G\right)+k+4$;

Condition 3.

$f\left(k\right)+1\le f(k+1)$.

Then, we can derive some theorems and corollaries as follows.

Corollary 1.

Let S be a fault set of G with $\left|S\right|\le f\left(k\right)+1$ and $k\ge 0$. If Conditions 1 and 3 hold, $G-S$ has a large component H with $\left|V\right(H\left)\right|\ge \left|S\right|$, and the union of the remaining components M has a maximum $k+1$ nodes.

Proof of Corollary 1.

Let F be a set with $\left|F\right|\le f(k+1)$. By Condition 1, $G-F$ contains a large component L such that $\left|V\right(L\left)\right|\ge \left|V\right(G\left)\right|-\left|F\right|-(k+1)$ and $\left|V\right(L\left)\right|\ge \left|F\right|$.

By Condition 3, $f\left(k\right)+1\le f(k+1)$. According to the conclusion of the previous paragraph, for any $S\subset V\left(G\right)$ with $\left|S\right|\le f\left(k\right)+1\le f(k+1)$, $G-S$ has a large component H such that $\left|V\right(H\left)\right|\ge \left|V\right(G\left)\right|-\left|S\right|-(k+1)$ and $\left|V\right(H\left)\right|\ge \left|S\right|$.    □

Theorem 1.

Let F be a fault set of G with $\left|F\right|\le f\left(k\right)+1$. If Condition 2 holds and $G-F$ contains a large component L with $\left|V\right(G\left)\right|-\left|F\right|-(k+1)⩽\left|V\right(L\left)\right|$, then $L\in T_0\left(G\right)$ with $\left|\tau \right(L\left)\right|>\left|F\right|$.

Proof of Theorem 1.

By Condition 2 and $\left|F\right|\le f\left(k\right)+1$, we can obtain

$$\begin{array}{c}\left|V\right(L\left)\right|\ge \left|V\right(G\left)\right|-\left|F\right|-(k+1)\hfill \\ \ge \Delta \left(G\right)f\left(k\right)+\Delta \left(G\right)+k+4-\left(f\right(k)+1)-(k+1)\hfill \\ =(\Delta (G)-1)f\left(k\right)+\Delta \left(G\right)+2.\hfill \end{array}$$

Therefore, we have $\left|V\right(L\left)\right|\ge 3$, for $\Delta \left(G\right)\ge 1$.

Since $\left|V\right(L\left)\right|\ge 3$ and L is a connected component, $\Delta \left(L\right)\ge 2$. By Lemma 3, we have $|V_2\left(L\right)|\ge \frac{\left|V\right(L\left)\right|-2}{\Delta \left(L\right)-1}\ge \frac{(\Delta (G)-1)f\left(k\right)+\Delta \left(G\right)}{\Delta \left(G\right)-1}>f\left(k\right)+1\ge \left|F\right|$. By Lemma 5, L is a 0-test subgraph under the comparison model, denoted by $L\in T_0\left(G\right)$. Moreover, by Lemma 6, we have $\left|\tau \left(L\right)\right|=|V_2\left(L\right)|>|F|$.    □

Theorem 2.

If Conditions 1 and 2 hold, G is $f\left(k\right)/k$-diagnosable under the comparison model.

Proof of Theorem 2.

Let F be a fault set of G with $\left|F\right|\le f\left(k\right)$. According to Condition 1, $G-F$ contains a large component L with $\left|V\right(L\left)\right|\ge \left|V\right(G\left)\right|-\left|F\right|-k$. By Theorem 1, $L\in T_0\left(G\right)$ with $\left|\tau \right(L\left)\right|>\left|F\right|$. That is, there exists a 0-test subgraph L such that $\left|V\right(L\left)\right|\ge \left|V\right(G\left)\right|-\left|F\right|-k$ and $\left|\tau \right(L\left)\right|>\left|F\right|$. By Lemma 7, all the nodes in L can be identified as fault-free. Since $\left|V\right(L\left)\right|\ge \left|V\right(G\left)\right|-\left|F\right|-k$, there are fewer than $\left|F\right|+k$ nodes that are unidentified. Hence, all the faulty nodes can be isolated into a node set, in which the number of fault-free nodes is no more than k. Therefore, under the comparison model, G is $f\left(k\right)/k$-diagnosable.    □

Furthermore, we continue to search for a higher value of t such that the system is $t/k$-diagnosable.

Theorem 3.

If Conditions 1–3 hold, then, under the comparison model, G is $f\left(k\right)+1/k$-diagnosable.

Proof of Theorem 3.

Let F be a fault set of G with $f\left(k\right)+1\ge \left|F\right|$. Now, we discuss the situation by considering the following scenarios.

Case 1. $\left|F\right|\le f\left(k\right)$

According to Condition 1, $G-F$ contains a large component H with $\left|V\right(H\left)\right|\ge \left|V\right(G\left)\right|-\left|F\right|-k$ and $\left|V\right(H\left)\right|\ge \left|F\right|$. By Theorem 1, $H\in T_0\left(G\right)$ with $\left|\tau \right(H\left)\right|>\left|F\right|$. Moreover, by Lemma 7, all the nodes in H can be identified as fault-free. Since $\left|V\right(H\left)\right|\ge \left|V\right(G\left)\right|-\left|F\right|-k$, there are fewer than $\left|F\right|+k$ unidentified nodes. Therefore, all the faulty nodes can be isolated in a node set containing a maximum bound of k fault-free nodes.

Case 2. $\left|F\right|=f\left(k\right)+1$

By Corollary 1, $G-F$ has a large component L with $\left|V\right(L\left)\right|\ge \left|F\right|$, and the union of the remaining components M has a maximum of $k+1$ nodes (see Figure 9). We have $N\left(M\right)\subseteq F$. By Theorem 1, L is a 0-test subgraph with $\left|\tau \right(L\left)\right|>\left|F\right|$. Hence, by Lemma 7, all the nodes in L can be identified as fault-free. There is a total of $\left|F\right|+\left|M\right|$ nodes that remain unidentified.

Case 2.1. $\left|M\right|\le k$.

Since $\left|M\right|\le k$, all faulty nodes can be isolated within a node set that at most k fault-free nodes are contained.

Case 2.2. $\left|M\right|=k+1$.

Suppose that $\left|N\right(M\left)\right|\le f\left(k\right)$. Let $F^{\prime }=N\left(M\right)$; we have $|F^{\prime }|\le f\left(k\right)$. By Condition 1, $G-F^{\prime }$ has a large component $L^{\prime }$ and a union of remaining components $M^{\prime }$ with $|M^{\prime }|\le k$ (see Figure 10a). Since $N\left(M\right)\subseteq F$ and $F^{\prime }=N\left(M\right)$, $F^{\prime }\subseteq F$. Therefore, $L\subseteq L^{\prime }$ and $M\subseteq M^{\prime }$. Then, $|M^{\prime }|\ge |M|=k+1$, which contradicts $|M^{\prime }|\le k$. Therefore, $\left|N\right(M\left)\right|\ge f\left(k\right)+1$. Since $\left|F\right|=f\left(k\right)+1$ and $N\left(M\right)\subseteq F$, we have $N\left(M\right)=F$ and $\left|N\right(M\left)\right|=\left|F\right|=f\left(k\right)+1$. That is, each node in F has a neighbor in M.

Suppose that $x\in F$ and $x\notin N\left(L\right)$ (see Figure 10b). Let $F^{″}=F-\left\{x\right\}$; we have $|F^{″}|=f\left(k\right)$. According to Condition 1, $G-F^{″}$ has a union of smaller components $M^{″}$ with $|M^{″}|\le k$ and a large component. Then, $M^{″}=M+\left\{x\right\}$. Therefore, $|M^{″}|=|M|+1\ge k+2$, which contradicts $|M^{″}|\le k$. Hence, each node in F is connected to at least one neighbor in L. That is, $F\subseteq N\left(L\right)$.

Since all the nodes belonging to L are fault-free, all the nodes in F can be identified as faulty (see Figure 10b), where $\left|F\right|=f\left(k\right)+1$. Note that $f\left(k\right)+1\ge \left|F\right|$, all nodes in M are identified as fault-free. Thus, all faulty nodes can be isolated within a node set, and no fault-free node is misidentified as faulty. Therefore, under the comparison model, G is $f\left(k\right)+1/k$-diagnosable.    □

Inspired by Lin et al. [8], we introduce a t/k-diagnosis Algorithm 1 under the comparison model.

Algorithm 1: t/k-diagnosis algorithm under the comparison model

Require: Conditions 1–3. Ensure: $(H,F_i)$, where H is the set of nodes that are identified as fault-free and $F_i$ is the set of nodes that are isolated. Step 1. $H=⌀$, $F_i=⌀$; Step 2. Use a depth-first traversal algorithm to derive all the 0-test units under the comparison model; Step 3. Obtain the tester of each 0-test units and merge 0-test units to construct $T_0\left(G\right)$, and set $T_0\left(G\right)=\{S_1,\dots ,S_r\}$; Step 4. Compute $\left|\tau \right(S_i\left)\right|$ for $1\le i\le r$, by merging testers in $S_i$; Step 5. For each 0-test subgraph $S_i$, if $\left|\tau \right(S_i\left)\right|>t$, then $H\leftarrow S_i$; Step 6. $F_i\leftarrow N\left(H\right)$; Step 7. If $|F_i|=t$, then $H\leftarrow V\left(G\right)-H-F_i$; else, $F_i\leftarrow V\left(G\right)-H-F_i$; Step 8. Return $(H,F_i)$.

The correctness of the $t/k$-diagnosis algorithm under the comparison model follows from Theorem 3. In this algorithm, steps 1 and 4–8 take $O\left(1\right)$ time. In step 2, the main computational process is based on pairs of adjacent edges. There are ${\displaystyle \sum _{x\in V\left(G\right)}}deg\left(x\right)(deg(x)-1)/2$ pairs of adjacent edges. Step 3 is based on 0-test units. In the worst case, step 3 need ${\displaystyle \sum _{x\in V\left(G\right)}}deg\left(x\right)(deg(x)-1)/2$ iterations to compare each pair of 0-test units to see if they have a common test edge. Take an n-dimensional hypercube network $Q_n$ as an example, $Q_n$ is an n-regular graph with $|V\left(Q_n\right)|=2^n$ [11]. Let $N=\left|V\right(Q_n\left)\right|$, we have $n=logN$. Then, ${\displaystyle \sum _{x\in V\left(Q^n\right)}}deg\left(x\right)(deg(x)-1)/2=2^n·n(n-1)/2=NlogN(logN-1)/2$. Hence, steps 2 and 3 take $O\left(N{log}^{2}N\right)$ time. As a result, the total time needed by this algorithm for n-dimensional hypercube networks is $O\left(N{log}^{2}N\right)$, where $N=\left|V\right(Q_n\left)\right|$.

5. Applications

5.1. Applications to Hypercube-like Networks

Hypercube-like networks are a class of networks (also called BC networks), which are defined recursively by a perfect matching operation [11] (see Figure 11). An n-dimensional hypercube-like network is written as $H_n$, where $|V\left(H_n\right)|=2^n$ [11]. Since $H_n$ is n-regular [12], we have $\Delta \left(H_n\right)=n$. Note that both $n>0$ and $k>0$ are integers, let $f\left(k\right)=n(k+1)-\frac{k^2+3k+2}{2}$; then, we have $f\left(k\right)\ge k$ for $k\le n-1$. Then, $H_n$ has the following properties.

Lemma 8.

$|V\left(H_n\right)|\ge 2f\left(k\right)+k+1$, where $n\ge 4$ and $k\le n-1$.

Proof of Lemma 8.

Since $|V\left(H_n\right)|=2^n$ and $k\le n-1$, we have

$$\begin{array}{c}\left|V\left(H_n\right)\right|-(2f\left(k\right)+k+1)\hfill \\ =2^n-2n(k+1)+k^2+3k+2-k-1\hfill \\ ={(k+(1-n\left)\right)}^2+2^n-n^2\hfill \\ \ge 0,\mathrm{for}n\ge 4.\hfill \end{array}$$

Therefore, $|V\left(H_n\right)|\ge 2f\left(k\right)+k+1$ for $n\ge 4$. □

Lemma 9

([13,14]). Let g and n be two positive integers with $g\le n-3$ and $n\ge 4$, and let $F\subset V\left(H_n\right)$ with $\left|F\right|\le ng-\frac{(g-1)(g+2)}{2}-1$. If $H_n-F$ is disconnected, there exists a large component in $H_n-F$ that includes a minimum of $2^n-\left|F\right|-(g-1)$ nodes.

Corollary 2.

Let $F\subset V\left(H_n\right)$ with $\left|F\right|\le f\left(k\right)$, $0\le k\le n-4$ and $n\ge 4$. If $H_n-F$ is disconnected, $H_n-F$ has a large component L and a union of smaller components of at most k nodes, where $\left|V\right(L\left)\right|\ge \left|F\right|$.

Proof of Corollary 2.

Let $k=g-1$; we have $\left|F\right|\le f\left(k\right)=f(g-1)=ng-\frac{{(g-1)}^2+3(g-1)+2}{2}=ng-\frac{(g-1)(g+2)}{2}-1$. By Lemma 9, $H_n-F$ has a large component L and a union of smaller components of at most k nodes. By Lemma 8, $|V\left(H_n\right)|\ge 2f\left(k\right)+k+1$. Then, we have

$$\begin{array}{c}\left|V\left(L\right)\right|\ge |V\left(H_n\right)|-|F|-k\hfill \\ \ge 2f\left(k\right)+k+1-f\left(k\right)-k\hfill \\ =f\left(k\right)+1\hfill \\ >\left|F\right|.\hfill \end{array}$$

□

Lemma 10.

$|V\left(H_n\right)|\ge \Delta \left(H_n\right)f\left(k\right)+\Delta \left(H_n\right)+k+4$, where $n\ge 10$ and $0\le k\le n-4$.

Proof of Lemma 10.

Since $0\le k\le n-4$ and $\Delta \left(H_n\right)=n$, we have

$$\begin{array}{c}\left|V\left(H_n\right)\right|-(\Delta (H_n)f\left(k\right)+\Delta (H_n)+k+4)\hfill \\ =2^n-n^2(k+1)+\frac{n(k^2+3k+2)}{2}-(n+k+4)\hfill \\ \ge 2^n-n^2(k+1)+n-(n+k+4)\hfill \\ =2^n-n^2(k+1)-(k+4)\hfill \\ \ge 2^n-n^2(n-3)-n\hfill \\ =2^n-n^3+3n^2-n\hfill \\ >0\mathrm{for}n\ge 10.\hfill \end{array}$$

Hence, when $n\ge 10$ and $0\le k\le n-4$, it holds that $|V\left(H_n\right)|\ge \Delta \left(H_n\right)f\left(k\right)+\Delta \left(H_n\right)+k+4$. □

Lemma 11.

$f\left(k\right)+1\le f(k+1)$ for $k\le n-3$.

Proof of Lemma 11.

Since $f\left(k\right)=n(k+1)-\frac{k^2+3k+2}{2}$ for $k\le n-1$, we have

$$\begin{array}{c}f\left(k\right)+1-f(k+1)\hfill \\ =n(k+1)-\frac{k^2+3k+2}{2}+1-(n(k+2)-\frac{{(k+1)}^2+3(k+1)+2}{2})\hfill \\ =k+3-n\le 0,\mathrm{for}k\le n-3.\hfill \end{array}$$

Therefore, $f\left(k\right)+1\le f(k+1)$ for $k\le n-2$. □

Then, the following result can be derived.

Theorem 4.

$H_n$ is $f\left(k\right)+1/k$-diagnosable under the comparison model for $0\le k\le n-4$ and $n\ge 10$.

Proof of Theorem 4.

By Corollary 2 and Lemmas 10 and 11, $H_n$ satisfies Conditions 1–3 for $0\le k\le n-4$ and $n\ge 10$. By Theorem 3, it is true that under the comparison model $H_n$ is $f\left(k\right)+1/k$-diagnosable. □

5.2. Applications to Folded Hypercubes

An n-dimensional folded hypercube $F{Q}_n$ is constructed by augmenting a hypercube $Q_n$ with $2n-1$ extra edges (see Figure 12), where $|V\left(F{Q}_n\right)|=2^n$ and $\Delta \left(F{Q}_n\right)=n+1$ [15]. Let $f\left(k\right)=(n+1)(k+1)-\frac{k^2+3k+2}{2}$ for $k\le n-1$; then, the following properties can be derived.

Lemma 12.

$|V\left(F{Q}_n\right)|\ge 2f\left(k\right)+k+1$, where $6⩽n$ and $k\le n-1$.

Proof of Lemma 12.

Since $|V\left(F{Q}_n\right)|=2^n$ and $k\le n-1$, we have

$$\begin{array}{c}|V\left({FQ}_n\right)|-(2f\left(k\right)+k+1)\hfill \\ =2^n-2(n+1)(k+1)+k^2+3k+2-k-1\hfill \\ ={(k-n)}^2+2^n-{(n+1)}^2\hfill \\ \ge 0,\mathrm{for}n\ge 6.\hfill \end{array}$$

Therefore, $|V\left(H_n\right)|\ge 2f\left(k\right)+k+1$ for $n\ge 6$. □

Lemma 13

([16]). Given two positive integers n and g with $n\ge 6$ and $1\le g\le \frac{n-1}{2}$, let $F\subset V\left(F{Q}_n\right)$ with $\left|F\right|\le (n+1)g-\frac{1}{2}(g^2+g)$. If $F{Q}_n-F$ is disconnected, $F{Q}_n-F$ has a large component and a union of smaller components of at most $g-1$ nodes.

Corollary 3.

Suppose that $n\ge 6$ and $0\le k\le \frac{n-3}{2}$ are integers, let $F\subset V\left(F{Q}_n\right)$ with $\left|F\right|\le f\left(k\right)$. If $F{Q}_n-F$ is disconnected, $F{Q}_n-F$ has a large component L and a union of smaller components of at most k nodes such that $\left|V\right(L\left)\right|\ge \left|F\right|$.

Proof of Corollary 3.

Let $k=g-1$, $f\left(k\right)=f(g-1)=(n+1)g-\frac{{(g-1)}^2+3(g-1)+2}{2}=(n+1)g-\frac{1}{2}(g^2+g)$. By Lemma 13, if $F{Q}_n-F$ is disconnected, $F{Q}_n-F$ has a large component and a union of smaller components of at most k nodes. By Lemma 12, $|V\left(F{Q}_n\right)|\ge 2f\left(k\right)+k+1$. Then, we have

$$\begin{array}{c}\left|V\left(L\right)\right|\ge |V\left(F{Q}_n\right)|-|F|-k\hfill \\ \ge 2f\left(k\right)+k+1-f\left(k\right)-k\hfill \\ =f\left(k\right)+1\hfill \\ >\left|F\right|.\hfill \end{array}$$

□

Lemma 14.

$|V\left(F{Q}_n\right)|\ge \Delta \left(F{Q}_n\right)f\left(k\right)+\Delta \left(F{Q}_n\right)+k+4$, where $10⩽n$ and $0\le k\le n-3$.

Proof of Lemma 14.

Since $0\le k\le n-3$ and $\Delta \left(F{Q}_n\right)=n+1$, we have

$$\begin{array}{c}|V\left(F{Q}_n\right)|-(\Delta \left(F{Q}_n\right)f\left(k\right)+\Delta \left(F{Q}_n\right)+k+4)\hfill \\ =2^n-{(n+1)}^2(k+1)+\frac{(n+1)(k^2+3k+2)}{2}-(n+k+5)\hfill \\ \ge 2^n-(n^2+2n+1)(k+1)-(k+4)\hfill \\ \ge 2^n-(n^2+2n+1)(n-2)-(n+1)\hfill \\ =2^n-n^3+2n-1\hfill \\ >0,forn\ge 10.\hfill \end{array}$$

Hence, when $10⩽n$ and $0\le k\le n-3$, $|V\left(F{Q}_n\right)|\ge \Delta \left(F{Q}_n\right)f\left(k\right)+\Delta \left(F{Q}_n\right)+k+4$. □

Lemma 15.

$f\left(k\right)+1\le f(k+1)$ for $k\le n-2$.

Proof of Lemma 15.

Since $f\left(k\right)=(n+1)(k+1)-\frac{k^2+3k+2}{2}$ for $k\le n-1$, we have

$$\begin{array}{c}f\left(k\right)+1-f(k+1)\hfill \\ =(n+1)(k+1)-\frac{k^2+3k+2}{2}+1-[(n+1)(k+2)-\frac{{(k+1)}^2+3(k+1)+2}{2}]\hfill \\ =k+2-n\le 0,\mathrm{for}k\le n-2.\hfill \end{array}$$

Therefore, $f\left(k\right)+1\le f(k+1)$ for $k\le n-2$. □

Then, we can obtain the following theorem.

Theorem 5.

$F{Q}_n$ is $f\left(k\right)+1/k$-diagnosable under the comparison model for $n\ge 10$ and $0\le k\le n-3$.

Proof of Theorem 5.

By Corollaries 3 and Lemmas 14–15, Conditions 1–3 hold for and $0\le k\le n-3$. Therefore, by Theorem 3, $H_n$ is $f\left(k\right)+1/k$-diagnosable under the comparison model for $n\ge 10$ and $0\le k\le n-3$. □

5.3. Applications to Star Graphs

The star graph $S_n$ is a sparsely connected graph with $\left|V\right(S_n\left)\right|=n!$ and $\Delta \left(S_n\right)=n-1$ [17]. Figure 13 shows $S_n$ for $n=4$. Let $f\left(k\right)=n(k+1)-3k-2$, where $k\in \{1,2,3\}$; then, $S_n$ has the following lemmas.

Lemma 16.

$|V\left(S_n\right)|\ge 2f\left(k\right)+k+1$ for $n\ge 4$ and $1\le k\le 3$.

Proof of Lemma 16.

Since $\left|V\right(S_n\left)\right|=n!$ and $n\ge 4$, we have

$$\begin{array}{c}|V\left(S_n\right)|-(2f\left(k\right)+k+1)\hfill \\ =n!-2\left[n\right(k+1)-3k-2]-k-1\hfill \\ =n!-2nk-2n+6k+4-k-1\hfill \\ =n!-2nk-2n+5k+3\hfill \\ =n!-2n(k+1)+5k+3\hfill \\ \ge 0,for1\le k\le 3.\hfill \end{array}$$

Therefore, $|V\left(S_n\right)|\ge 2f\left(k\right)+k+1$ for $n\ge 4$ and $1\le k\le 3$. □

Lemma 17

([18,19]). Suppose that $n\ge 4$ and F is a subset of $S_n$ such that $\left|F\right|\le 2n-5$. $S_n-F$ has a large component and at most one singleton.

Lemma 18

([18,19]). Let F be a subset of $S_n$ with $\left|F\right|\le 3n-8$ and $n\ge 4$. $S_n-F$ consists of a large component and a collection of smaller components containing no more than two nodes.

Lemma 19

([17]). Let F be a subset of $S_n$ with $\left|F\right|\le 4n-11$ and $n\ge 4$. If $S_n-F$ is disconnected, $S_n-F$ has a large component and a union of smaller components of at most three nodes.

Motivated by Lemmas 16–19, we have the following lemmas.

Lemma 20.

Let F be a subset of $S_n$ with $\left|F\right|\le f\left(k\right)$, $n\ge 4$ and $1\le k\le 3$. If $S_n-F$ is disconnected, $S_n-F$ consists of a large component L and a collection of smaller components containing no more than k nodes such that $\left|V\right(L\left)\right|\ge \left|F\right|$.

Proof of Lemma 20.

By Lemmas 17–19, $S_n-F$ consists of a large component L and a collection of smaller components containing no more than k nodes for $1\le k\le 3$. Then, by Lemma 16, we have

$$\begin{array}{c}\left|V\left(L\right)\right|\ge |V\left(S_n\right)|-|F|-k\hfill \\ \ge 2f\left(k\right)+k+1-\left|F\right|-k\hfill \\ \ge 2f\left(k\right)+k+1-f\left(k\right)-k\hfill \\ =f\left(k\right)+1\hfill \\ >\left|F\right|.\hfill \end{array}$$

Hence, $\left|V\right(L\left)\right|\ge \left|F\right|$. □

Lemma 21.

Suppose that $5⩽n$ and $1\le k\le 3$. Then, $|V\left(S_n\right)|\ge \Delta \left(S_n\right)f\left(k\right)+\Delta \left(S_n\right)+k+4$.

Proof of Lemma 21.

We have $\Delta \left(S_n\right)=n-1$ and $\left|V\right(S_n\left)\right|=n!$ [17]. Since $1\le k\le 3$ and $n\ge 5$,

$$\begin{array}{l}\left|V\left(S_n\right)\right|-(\Delta \left(S_n\right)f\left(k\right)+\Delta \left(S_n\right)+k+4)\\ =n!-n(n-1)(k+1)+(n-1)(3k+2)-(n+k+3)\\ =n!-(k+1)n^2+(3k+1)n-(3k+4)\\ >n!-(k+1)n^2\\ \ge n!-4n^2\\ >0.\end{array}$$

Hence, when $5⩽n$ and $1\le k\le 3$, it is true that $|V\left(S_n\right)|\ge \Delta \left(S_n\right)f\left(k\right)+\Delta \left(S_n\right)+k+4$. □

Lemma 22.

$f\left(k\right)+1\le f(k+1)$ for $1\le k\le 3$ and $n\ge 4$.

Proof of Lemma 22.

Note that $f\left(k\right)=n(k+1)-3k-2$, where $1\le k\le 3$, we have

$$\begin{array}{c}f\left(k\right)+1-f(k+1)\hfill \\ =n(k+1)-3k-2+1-[n(k+2)-3(k+1)-2]\hfill \\ =-n+4\hfill \\ \ge 0,forn\ge 4.\hfill \end{array}$$

Therefore, $f\left(k\right)+1\le f(k+1)$ for $1\le k\le 3$ and $n\ge 4$. □

Therefore, for $f\left(k\right)=n(k+1)-3k-2$, we obtain the following theorem.

Theorem 6.

$S_n$ is $f\left(k\right)+1/k$-diagnosable under the comparison model for $n\ge 5$ and $1\le k\le 3$.

Proof of Theorem 6.

By Lemmas 20–22, Conditions 1–3 hold for $n\ge 5$ and $1\le k\le 3$. Therefore, by Theorem 3, $S_n$ is $f\left(k\right)+1/k$-diagnosable under the comparison model for $n\ge 5$ and $1\le k\le 3$. □

5.4. Applications to Complete Cubic Networks

An n-dimensional complete cubic network, written as $CN\left(n\right)$, is a special class of hierarchical cubic networks [20]. Figure 14 shows $CN\left(n\right)$ for $n=2$. According to the definition of $CN\left(n\right)$, we have $\left|V\left(CN\left(n\right)\right)\right|=2^{2n}$ and $\Delta \left(CN\right(n\left)\right)=n+1$. Let $f\left(k\right)=n(k+1)-\frac{k(k+1)}{2}$ for $0\le k\le n-1$; then, the following properties can be obtained.

Lemma 23.

$\left|V\right(CN\left(n\right)\left)\right|\ge 2f\left(k\right)+k+1$ for $n\ge 2$ and $0\le k\le n-1$.

Proof of Lemma 23.

Since $\left|V\left(CN\left(n\right)\right)\right|=2^{2n}$ and $0\le k\le n-1$, we have

$$\begin{array}{c}\left|V\left(CN\left(n\right)\right)\right|-\left(2f\right(k)+k+1)\hfill \\ =2^{2n}-2(n(k+1)-\frac{k(k+1)}{2})-k-1\hfill \\ =2^{2n}-2nk-2n+k^2+k-k-1\hfill \\ =2^{2n}-2nk-2n+k^2-1\hfill \\ =2^{2n}-2(k+1)n+k^2-1\hfill \\ =2^{2n}-2n^2\hfill \\ \ge 0,forn\ge 2.\hfill \end{array}$$

Therefore, $\left|V\right(CN\left(n\right)\left)\right|\ge 2f\left(k\right)+k+1$ for $n\ge 2$ and $0\le k\le n-1$. □

Lemma 24

([20]). Let $n\ge 2$ and $1\le g\le n$. For any $F\subset V\left(CN\right(n\left)\right)$ with $\left|F\right|\le gn-\frac{g(g-1)}{2}$, there exists a large component and several smaller components containing a maximum of $g-1$ nodes in $CN\left(n\right)-F$.

By Lemma 24, we can deduce the following corollary.

Corollary 4.

Let $F\subset V\left(CN\right(n\left)\right)$ with $n\ge 2$, $0\le k\le n-1$ and $\left|F\right|\le n(k+1)-\frac{k(k+1)}{2}$. In $CN\left(n\right)-F$, there exists a large component L and several smaller components containing a maximum of k nodes, where $\left|V\right(L\left)\right|\ge \left|F\right|$.

Proof of Corollary 4.

By Lemma 24, let $k=g-1$, we have $\left|F\right|\le ng-\frac{g(g-1)}{2}$. Then, there exists a large component L and several smaller components containing a maximum of g nodes in $CN\left(n\right)-F$, where $n\ge 2$ and $0\le k\le n-1$. Then, we have $\left|V\right(L\left)\right|\ge \left|V\right(CN\left(n\right)\left)\right|-\left|F\right|-k$. By Lemma 23,

$$\begin{array}{c}\left|V\right(L\left)\right|\ge \left|V\right(CN\left(n\right)\left)\right|-\left|F\right|-k\hfill \\ \ge 2f\left(k\right)+k+1-\left|F\right|-k\hfill \\ \ge 2f\left(k\right)+k+1-f\left(k\right)-k\hfill \\ =f\left(k\right)+1\hfill \\ >\left|F\right|.\hfill \end{array}$$

Hence, $\left|V\right(L\left)\right|\ge \left|F\right|$. □

Lemma 25.

$\left|V\right(CN\left(n\right)\left)\right|\ge \Delta \left(CN\right(n\left)\right)f\left(k\right)$

$+\Delta \left(CN\right(n\left)\right)+k+4$ for $0\le k\le n-1$ and $n\ge 3$.

Proof of Lemma 25.

We have $\left|V\left(CN\left(n\right)\right)\right|=2^{2n}$ and $\Delta \left(CN\right(n\left)\right)=n+1$. Since $0\le k\le n-1$ and $n\ge 3$,

$$\begin{array}{c}\left|V\left(CN\left(n\right)\right)\right|-(\Delta \left(CN\right(n\left)\right)f\left(k\right)+\Delta \left(CN\right(n\left)\right)+k+4)\hfill \\ =2^{2n}-n(n+1)(k+1)+\frac{(n+1)(k^2+k)}{2}-(n+k+5)\hfill \\ \ge 2^{2n}-(n^2+n)(k+1)-(n+k+5)\hfill \\ \ge 2^{2n}-(n^3+n^2+2n+4)\hfill \\ >0.\hfill \end{array}$$

Hence, $\left|V\right(CN\left(n\right)\left)\right|\ge \Delta \left(CN\right(n\left)\right)f\left(k\right)+\Delta \left(CN\right(n\left)\right)+k+4$ for $0\le k\le n-1$ and $n\ge 3$. □

Lemma 26.

$f\left(k\right)+1\le f(k+1)$ for $0\le k\le n-2$.

Proof of Lemma 26.

Since $f\left(k\right)=n(k+1)-\frac{k(k+1)}{2}$ for $0\le k\le n-2$, we have

$$\begin{array}{l}f\left(k\right)+1-f(k+1)\\ =n(k+1)-\frac{k(k+1)}{2}+1-[n(k+2)-\frac{(k+1)(k+2)}{2}]\\ =-n+k+2\\ \le 0.\end{array}$$

Therefore, $f\left(k\right)+1\le f(k+1)$ for $0\le k\le n-2$. □

Theorem 7.

$CN\left(n\right)$ is $f\left(k\right)+1/k$-diagnosable under the comparison model for $n\ge 3$ and $0\le k\le n-2$.

Proof of Theorem 7.

By Corollary 4 and Lemmas 25 and 26, Conditions 1–3 hold for $0\le k\le n-2$ and $n\ge 3$. Therefore, by Theorem 3, $H_n$ is $f\left(k\right)+1/k$-diagnosable for $n\ge 10$ and $0\le k\le n-2$. □

6. Conclusions

$t/k$-diagnosability is an important diagnostic strategy that can improve the self-diagnosing capability of multiprocessor systems. While significant progress has been made in $t/k$-diagnosability under the PMC model in the last half century, $t/k$-diagnosability and $t/k$-diagnosis algorithms for many regular networks under the comparison model have yet to be determined. In this paper, inspired by the 0-test subgraph under the PMC model, we introduce some useful notions for the comparison model, such as the 0-test unit, 0-test set, and 0-test subgraph. Then, we study the properties of 0-test subgraphs under the comparison model. Furthermore, we derive some key theorems about $t/k$-diagnosability and the $t/k$-diagnosis algorithm under the comparison model. Finally, the applications of our results to some regular networks are demonstrated.

In the article, we calculate the $t/k$-diagnosability for regular networks based on the comparison model. Considering that N-ary M-cube networks are more general than regular networks in terms of network topology, in the future, we will investigate the $t/k$-diagnosability problem of N-ary M-cube networks under the comparison model.