A new approach for manipulating Forrester diagram in system dynamics

Abstract A new approach for manipulating Forrester diagram (FD) in system dynamics is introduced. The FD is defined by attributed graphs so as to apply the approach. Three basic algorithms are proposed to perform this work and an illustrative example is given to verify the result.

[1]  José Javier Dolado,et al.  Formal manipulation of Forrester diagrams by graph grammars , 1988, IEEE Trans. Syst. Man Cybern..

[2]  James R. Burns.  Converting Signed Digraphs to Forrester Schematics and Converting Forrester Schematics to Differential Equations , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

[3]  Juan M. Ramos.  Some modifications to the Burns algorithm , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[4]  Horst Bunke.  Attributed Programmed Graph Grammars and Their Application to Schematic Diagram Interpretation , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Onur M. Ülgen,et al.  An Algorithm for Converting Signed Digrapls to Forrester Schematics , 1979, IEEE Transactions on Systems, Man, and Cybernetics.