The article advances and discusses a theory that using diagraph theory to analyse SD flow diagram. First, on the basis of the concept strongly connected digraph generation out-tree and extreme out-tree, we prove two existence generation out-tree theorem and three relative propositions of flow diagram generation out-tree. The method to define the extreme out-tree and feedback loop set are obtained in complicated SD flow diagrams, also the general laws are advanced that each variable produces corresponding increment that in the feedback loop and extreme out-tree and at the different simulation moment, one increment ∆x is given certain variable x. All these conclusions are useful to the debugging and the result-analysis of SD model and are also useful to analyse the effects of controll variable in system.

This is the whole item.

Date created

• 1991

Type

• Document

Processing Activity

• Processing documentation available at: https://wiki.albany.edu/display/SCA/Processing+Ingested+Digital+Files

License

• Creative Commons BY-NC-ND Attribution-NonCommercial-NoDerivs 4.0 International

  
  Contact Us for questions or additional rights.

ITEM CONTEXT

Part of

d1cfc0fcedb4f6334f34d1ca11dcf292

Scope and Contents

Part of

5d7e83a7ca6c4cd9ab0ccc8a805a7aa7

Scope and Contents

Part of

23d738ba88f8333bc39725f9cb5bd0b8

Scope and Contents

Collection

System Dynamic Society Records

Scope and Contents

Collecting area

• This collection is part of the University Archives