Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

An Approach to Error-Free Flow-Graph Equations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

The attractiveness of the flow-graph analysis of systems lies to a great extent in the ability to manipulate the graph by inspection. Nevertheless, in large flow graphs the inspection technique is often a shaky one for writing transmission equations. If one insists on using the flow-graph approach, a systematic mathematical means is needed to assure that no loops, paths, or contiguous conditions among loops and/or paths are missed. This paper describes an analytical-combinatorial method, which produces error-free transmission equations. Use is made of suitably modified vertex matrices and combinatorially developed path-vertex-loop matrices.

Published in:

Education, IEEE Transactions on  (Volume:10 ,  Issue: 4 )