An Algorithm for Automatic Reduction of Complex Signal Flow Graphs

[+] Author and Article Information
K. R. Young

Reconition Equipment, Inc., Dallas, Tex.

L. L. Hoberock

Mechanical Engineering Department, University of Texas, Austin, Tex.

J. G. Thompson

Mechanical Engineering Department, Kansas State University, Manhattan, Kan.

J. Dyn. Sys., Meas., Control 98(4), 367-374 (Dec 01, 1976) (8 pages) doi:10.1115/1.3427053 History: Received August 05, 1976; Online July 13, 2010


A computer algorithm is developed that provides efficient means to compute transmittances directly from a signal flow graph or a block diagram. Signal flow graphs are cast as directed graphs described by adjacency matrices. Nonsearch computation, designed for compilers without symbolic capability, is used to identify all arcs that are members of simple cycles for use with Mason’s gain formula. The routine does not require the visual acumen of an interpreter to reduce the topology of the graph, and it is particularly useful for analyzing control systems described for computer analyses by means of interactive graphics.

Copyright © 1976 by ASME
Your Session has timed out. Please sign back in to continue.





Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In