Abstract
An algorithm for converting signed digraphs to Forrester schematics is described and illustrated. A theoretical framework for the algorithm consisting of theorems is developed first. This theoretical framework is based upon discussions found in a companion paper [1]. Specifically, the algorithm uses the definitional properties of the various quantities and couplings, the consistency supposition, and related axioms and theorems as outlined in [1]. The algorithm is applied to an illustrative example.
| Original language | English |
|---|---|
| Pages (from-to) | 115-125 |
| Journal | IEEE Transactions on Systems, Man and Cybernetics |
| State | Published - Mar 1979 |