An Algorithm for Converting Signed Digraphs to Forrester Schematics

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

doi:10.1109/TSMC.1979.4310167

An Algorithm for Converting Signed Digraphs to Forrester Schematics

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

Business Administration

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	115-124
Number of pages	10
Journal	IEEE Transactions on Systems, Man and Cybernetics
Volume	9
Issue number	3
DOIs	https://doi.org/10.1109/TSMC.1979.4310167
State	Published - Mar 1979

Access to Document

10.1109/TSMC.1979.4310167

Link to publication in Scopus

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

Cite this

@article{cd642b022e944a38a17e1e8c109853a7,

title = "An Algorithm for Converting Signed Digraphs to Forrester Schematics",

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.",

author = "Burns, {James R.} and Ulgen, {Onur M.} and Beights, {Harvey W.}",

year = "1979",

month = mar,

doi = "10.1109/TSMC.1979.4310167",

language = "English",

volume = "9",

pages = "115--124",

journal = "IEEE Transactions on Systems, Man and Cybernetics",

issn = "0018-9472",

number = "3",

}

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 -