A Method for Simplification of Complex Group Causal Loop Diagrams Based on Endogenisation, Encapsulation and Order-Oriented Reduction
Vladimír Bureš
Systems · 2017
doi:10.3390/systems5030046 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Growing complexity represents an issue that can be identified in various disciplines. In system dynamics, causal loop diagrams are used for capturing dynamic nature of modelled systems. Increasing complexity of developed diagrams is associated with the tendency to include more variables into a model and thus make it more realistic and improve its value. This is even multiplied during group modelling workshops where several perspectives are articulated, shared and complex diagrams developed. This process easily generates complex diagrams that are difficult or even impossible to be comprehended by individuals. As there is a lack of available methods that would help users to cope with growing complexity, this manuscript suggests an original method. The proposed method systematically helps to simplify the complex causal loop diagrams. It is based on three activities iteratively applied during particular steps: endogenisation, encapsulation and order-oriented reduction. Two case studies are used to explain method details, prove its applicability and highlight added value. Case studies include the simplification of both original group causal loop diagram, and group diagram adapted from a study already published in a prestigious journal. Although the presented method has its own limitations, meaningfulness of its application in practice is verified. The method can help to cope with the complexity in any domain, in which causal loop diagrams are used.
Abstract licence: CC BY
References57
- 26.
39 more references, whose wording the paper’s licence keeps private.
All 57 referencesReads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.