Distinguishability Criteria in Oriented Graphs and Their Application to Computer Diagnosis-I
Wataru Mayeda, C. V. Ramamoorthy · IEEE Transactions on Circuit Theory · 1969
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.