TY - JOUR
T1 - An Algorithm for Converting Signed Digraphs to Forrester Schematics
AU - Burns, James R.
AU - Ulgen, Onur M.
AU - Beights, Harvey W.
PY - 1979/3
Y1 - 1979/3
N2 - An algorithm for converting signed digraphs to Forrester schematics is described and illustrated. A theoretical frame-work 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.
AB - An algorithm for converting signed digraphs to Forrester schematics is described and illustrated. A theoretical frame-work 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.
UR - http://www.scopus.com/inward/record.url?scp=0018442878&partnerID=8YFLogxK
U2 - 10.1109/TSMC.1979.4310167
DO - 10.1109/TSMC.1979.4310167
M3 - Article
AN - SCOPUS:0018442878
VL - 9
SP - 115
EP - 124
JO - IEEE Transactions on Systems, Man and Cybernetics
JF - IEEE Transactions on Systems, Man and Cybernetics
SN - 0018-9472
IS - 3
ER -