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 Masons 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
Security Markings
DOCUMENT & CONTEXTUAL SUMMARY
Distribution:
Approved For Public Release
RECORD
Collection: TR