DISTINGUISHABILITY CRITERIA IN ORIENTED GRAPHS AND ITS APPLICATION TO COMPUTER DIAGNOSIS - I.

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. (Author)

Document Details

Document Type
Technical Report
Publication Date
Sep 30, 1968
Accession Number
AD0685739

Entities

People

  • C. V. Ramamoorthy
  • W. Mayeda

Organizations

  • University of Texas at Austin

Tags

DTIC Thesaurus Topics

  • Computer Science
  • Computers
  • Computing Devices
  • Digital Computers
  • Graph Theory

Fields of Study

  • Computer science

Readers

  • Graph Algorithms and Convex Optimization.
  • Systems Analysis and Design