DocumentCode
1165809
Title
Distinguishability Criteria in Oriented Graphs and Their Application to Computer Diagnosis-I
Author
Mayeda, Wataru ; Ramamoorthy, C.V.
Volume
16
Issue
4
fYear
1969
fDate
11/1/1969 12:00:00 AM
Firstpage
448
Lastpage
454
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
Computer diagnosis; Digital computers; Graph theory; Application software; Circuit faults; Computer applications; Graph theory; Helium; Large scale integration; Microelectronics; Power supplies; Sequential analysis; System testing;
fLanguage
English
Journal_Title
Circuit Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9324
Type
jour
DOI
10.1109/TCT.1969.1083003
Filename
1083003
Link To Document