Issue No. 10 - October (1975 vol. 24)
J. Nieminen , Department of Technical Sciences, Finnish Academy
Mayeda and Ramamoorthy have reduced the problem of finding a minimum number of test points which detect an improperly operating functional element of a single entry-single exit (SEC) system graph, to the problem of finding a minimum number of edges under which this system graph is 1 distinguishable. This correspondence shows that the determilnation of the minimum edge set is equivalent to the determination of a minimum covering of a certain matrix M (S) of zeros and ones. A way of finding the matrix M (S) is proposed.
Directed graphs, fault location, minimum coverng, minimum number of test points, one distinguishability.
J. Nieminen, "A New Method of Formulating a Minimum Edge Set," in IEEE Transactions on Computers, vol. 24, no. , pp. 1015-1018, 1975.