Accession Number : AD0690127
Title : DISTINGUISHABILITY CRITERIA IN ORIENTED GRAPHS AND ITS APPLICATION TO COMPUTER DIAGNOSIS - II.
Descriptive Note : Technical memo.,
Corporate Author : TEXAS UNIV AUSTIN ELECTRONICS RESEARCH CENTER
Personal Author(s) : Mayeda,W. ; Ramamoorthy,C. V.
Report Date : 21 FEB 1969
Pagination or Media Count : 23
Abstract : In a previous paper (AD-685 739) the authors considered the application of graph theory to the problems in computer diagnosis. In particular the distinguishability criteria in directed graphs is developed and bounds on the number of test points needed to locate faults in a sequential system are derived. In the present paper it is shown that a system can also be diagnosed by means of test gates which block or unblock the flow of output signals at selected points in the system. In particular the distinguishebility criteria in directed graphs is developed using only test gates, and bounds on the number of test gates needed to locate faults in a sequential system are derived. Since implementing test gates is vastly easier and cheaper than inserting and monitoring test points, the schemes proposed and results developed appear to be of practical significance. (Author)
Descriptors : (*COMPUTERS, MAINTENANCE), FAILURE, GRAPHICS, SEQUENTIAL ANALYSIS, INFORMATION THEORY
Subject Categories : Computer Hardware
Distribution Statement : APPROVED FOR PUBLIC RELEASE