On Adaptive System Diagnosis

In the theory of t-fault-diagnosable systems, one first chooses a set of diagnostic tests, then seeks the results of these tests, and finally proceeds to use the test results to identify the faulty units assuming that the number of faulty units does not exceed t. Nakajima was the first to suggest a departure from this practice. He proposed to adaptively choose the tests and to seek their results until one can identify a fault-free unit. This fault-free unit may then be used as a tester to identify all faulty units. In this paper, we exploit this idea fully and show that one needs the results of at most (n + 2t −2) adaptive tests to identify all faulty units in a t-fault-diagnosable system with n units. The impact of the applications of this idea to the various models and diagnosis algorithms is examined.

[1]  James E. Smith.  Universal System Diagnosis Algorithms , 1979, IEEE Transactions on Computers.

[2]  Kozo Kinoshita,et al.  Connection Assignments for Probabilistically Diagnosable Systems , 1978, IEEE Transactions on Computers.

[3]  S. Louis Hakimi,et al.  An Adaptive Algorithm for System Level Diagnosis , 1984, J. Algorithms.

[4]  S. Louis Hakimi,et al.  Characterization of Connection Assignment of Diagnosable Systems , 1974, IEEE Transactions on Computers.

[5]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[6]  Jon T. Butler.  Speed-Efficiency-Complexity Tradeoffs in Universal Diagnosis Algorithms , 1981, IEEE Transactions on Computers.

[7]  Kyung-Yong Chwa,et al.  Schemes for Fault-Tolerant Computing: A Comparison of Modularly Redundant and t-Diagnosable Systems , 1981, Inf. Control..

[8]  Gerald M. Masson,et al.  Diagnosable Systems for Intermittent Faults , 1978, IEEE Transactions on Computers.

[9]  S. Louis Hakimi,et al.  On Models for Diagnosable Systems and Probabilistic Fault Diagnosis , 1976, IEEE Transactions on Computers.

[10]  Charles R. Kime,et al.  System Fault Diagnosis: Masking, Exposure, and Diagnosability Without Repair , 1975, IEEE Transactions on Computers.

[11]  Fabrizio Grandoni,et al.  A Theory of Diagnosability of Digital Systems , 1976, IEEE Transactions on Computers.

[12]  Luca Simoncini,et al.  Analysis and Optimal Design of Self-Diagnosable Systems with Repair , 1979, IEEE Transactions on Computers.

[13]  Pavel M. Blecher,et al.  On a logical problem , 1983, Discret. Math..

[14]  GERNOT METZE,et al.  On the Connection Assignment Problem of Diagnosable Systems , 1967, IEEE Trans. Electron. Comput..

[15]  S. Hakimi,et al.  On a theory of t-fault diagnosable analog systems , 1984 .

[16]  Kyung-Yong Chwa,et al.  On Fault Identification in Diagnosable Systems , 1981, IEEE Transactions on Computers.

[17]  James E. Smith,et al.  Diagnosis of Systems with Asymmetric Invalidation , 1981, IEEE Transactions on Computers.

[18]  Kozo Kinoshita,et al.  Some Existence Theorems for Probabilistically Diagnosable Systems , 1978, IEEE Transactions on Computers.

[19]  Udi Manber.  System Diagnosis with Repair , 1980, IEEE Transactions on Computers.

[20]  Peter Weiner,et al.  Optimization of Reduced Dependencies for Synchronous Sequential Machines , 1967, IEEE Trans. Electron. Comput..

[21]  Charles R. Kime,et al.  System Fault Diagnosis: Closure and Diagnosability with Repair , 1975, IEEE Transactions on Computers.

[22]  Chin-Long Wey,et al.  Analog Fault Diagnosis with Failure Bounds , 1982 .

[23]  Jon Gregory Kuhl.  Fault diagnosis in computing networks , 1980 .