An Algorithm for Converting Signed Digraphs to Forrester Schematics

James Burns, Wayne Beights, Onur Ulgen

Research output: Contribution to journalArticlepeer-review


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 languageEnglish
Pages (from-to)115-125
JournalIEEE Transactions on Systems, Man and Cybernetics
StatePublished - Mar 1979


Dive into the research topics of 'An Algorithm for Converting Signed Digraphs to Forrester Schematics'. Together they form a unique fingerprint.

Cite this