On Fault Identification in Interconnection Networks under the Comparison Model

We propose three characterization theorems of t/t - diagnosable systems under the comparison model. By these characterization theorems we present some properties of t/t - diagnosable systems. Furthermore, for a given network system, we introduce a new method to determine a range from t(min) to t(max) conveniently, in which the system is at least t(min)/ t(min) - diagnosable and at most t(max)/t(max)- diagnosable. By applying our results to some well-known networks such as n-dimensional hypercube, 2(D) (3D) mesh, and permutation star graph, we figure out their t/t-diagnosability.