An Algorithm for Converting Signed Digrapls to Forrester Schematics

1979; Institute of Electrical and Electronics Engineers; Volume: 9; Issue: 3 Linguagem: Inglês

10.1109/tsmc.1979.4310167

ISSN

2168-2909

Autores

James R. Burns, Onur M. Ülgen, Harvey W. Beights,

Tópico(s)

Data Visualization and Analytics

Resumo

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.

Referência(s)