By Topic

An Algorithm for Converting Signed Digrapls to Forrester Schematics

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)

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.

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:9 ,  Issue: 3 )