Fault Diagnosis by Inserting the Minimum Number of Test Points in System Graphs.
Research technical rept.,
MONTANA STATE UNIV BOZEMAN ELECTRONICS RESEARCH LAB
Pagination or Media Count:
Classical methods of fault-diagnosis in combinational and sequential logic are effective for small circuits, but are too exhaustive and do not provide any systematic way for analyzing entire computer systems. Large scale integration and increased complexity of present-day computer systems have created a need for new graph theory approaches for understanding, analyzing and visualizing malfunctions in these systems. The object of this report has been the development of an algorithm for inserting test points in system structure to obtain maximum improvement. The algorithm is initiated using only basic information edge connections and generates the locations of test points. Test points obtained are the minimum for a given system graph. The algorithm is computationally efficient. The report also includes theorems on lower bounds on the number of test points required for a system graph. Modified author abstract
- Computer Programming and Software