An Algorithm for Converting Signed Digraphs to Forrester Schematics

James R. Burns, Onur M. Ulgen, Harvey W. Beights

Research output: Contribution to journalArticlepeer-review

9 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)115-124
Number of pages10
JournalIEEE Transactions on Systems, Man and Cybernetics
Volume9
Issue number3
DOIs
StatePublished - Mar 1979

Fingerprint

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

Cite this