Algorithms for symbolic reduction of signal flow graphs

In this paper certain properties of algorithms used in symbolic manipulation on signal flow graphs are investigated. The rule-based approach and Mason's formula are compared with respect to preservation of minimal rational representation. It is shown by counter example that rule-based method does not possess this property if factor cancellations are allowed at elementary operation level only. A new efficient algorithm is proposed in which this problem is resolved.