Distinguishability Criteria in Oriented Graphs and Their Application to Computer Diagnosis-I

Discrete sequential systems like the functional elements of a digital computer can be represented by directed graphs. In this paper we study an application of graph theory to computer diagnosis. Specifically, we develop the distinguishability criteria in directed graphs and derive bounds on the number of test points needed to locate faults in a sequential system.

[1]  Sundaram Seshu,et al.  The Diagnosis of Asynchronous Sequential Switching Systems , 1962, IRE Trans. Electron. Comput..

[2]  C. V. Ramamoorthy,et al.  A structural theory of machine diagnosis , 1899, AFIPS '67 (Spring).

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

[4]  Eric George Manning.  On Computer Self-Diagnosis Part I-Experimental Study of a Processor , 1966, IEEE Trans. Electron. Comput..