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

1 November 1969

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuit Theory

Vol. 16 (4) , 448-454
https://doi.org/10.1109/tct.1969.1083003

Abstract

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.

Keywords

This publication has 4 references indexed in Scilit:

On the Connection Assignment Problem of Diagnosable Systems
IEEE Transactions on Electronic Computers, 1967
A structural theory of machine diagnosis
Published by Association for Computing Machinery (ACM) ,1967
On Computer Self-Diagnosis Part I-Experimental Study of a Processor
IEEE Transactions on Electronic Computers, 1966
The Diagnosis of Asynchronous Sequential Switching Systems
IEEE Transactions on Electronic Computers, 1962