TY - GEN
T1 - Systematic aggregation of dependency models - Principles and forms of aggregating several domains
AU - Kreimeyer, Matthias
AU - Bradford, Nikolas
AU - Langer, Stefan
AU - Biedermann, Wieland
AU - Lindemann, Udo
PY - 2010
Y1 - 2010
N2 - 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.
AB - 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.
KW - Aggregation
KW - Design structure matrix
KW - Domains
KW - Multiple-domain matrix
KW - Structural complexity
UR - http://www.scopus.com/inward/record.url?scp=79960522511&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:79960522511
SN - 9789051550603
T3 - Proceedings of the 8th International Symposium on Tools and Methods of Competitive Engineering, TMCE 2010
SP - 1121
EP - 1134
BT - Proceedings of the 8th International Symposium on Tools and Methods of Competitive Engineering, TMCE 2010
T2 - 8th International Symposium on Tools and Methods of Competitive Engineering, TMCE 2010
Y2 - 12 April 2010 through 16 April 2010
ER -