Computer Aided Flow Graph Analysis.

Abstract

A generalized technique for the solution of engineering problems which can be represented in the form of flow graphs has been developed. The fundamental algorithm is one whereby the paths and loops in a flow graph can be systematically and selectively enumerated. This algorithm serves as the basis for a procedure whereby Mason's rule can be efficiently applied to generate characterustic equations, system determinants, transfer functions defining input-output relationships, sensitivity functions, and other important network functions related to signal flow graphs. (Author)

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1972
Accession Number
AD0759783

Entities

People

  • Ernest J. Henley
  • Ray A. Williams

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computers
  • Engineering
  • Equations
  • Mathematics
  • Transfer Functions

Readers

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