Systematic aggregation of dependency models - principles and forms of aggregating several domains

Engineered systems are often modeled as dependency models that are analyzed for their structure, i.e. the constellation of their entities and how these are related, to better plan, design, and improve the behavior of the system. Often, these dependency models consist of different coexisting classes of entities (domains) and relations (relationship types). As such models often are complex to use, it is at times necessary to generate more condensed models to see how different entities depend upon each other. Therefore, this paper discusses the principles of aggregating large network structures that consist of several domains into condensed, aggregate views. Three different strategies are proposed, based on existing work in various disciplines: Path searching, attribution, and superposition. Each aggregate view can be understood as a reduced, yet not simplified recombination of several domains and relationship types. For each of the three strategies, the resulting aggregate models are reviewed, and principles to working with the resulting aggregate relationship types are presented. An example analysis of a complex process model is shown to illustrate that aggregation enables the application of common analysis methodology and algorithms that exist for dependency models.     «

Engineered systems are often modeled as dependency models that are analyzed for their structure, i.e. the constellation of their entities and how these are related, to better plan, design, and improve the behavior of the system. Often, these dependency models consist of different coexisting classes of entities (domains) and relations (relationship types). As such models often are complex to use, it is at times necessary to generate more condensed models to see how different entities depend upon...     »