Abstract | ||
---|---|---|
Attribute-driven software architecture design aims to provide decision support by taking into account the quality attributes of softwares. A central question in this process is: What architecture design best fulfills the desirable software requirements? To answer this question, a system designer needs to make tradeoffs among several potentially conflicting quality attributes. Such decisions are normally ad-hoc and rely heavily on experiences. We propose a mathematical approach to tackle this problem. Game theory naturally provides the basic language: Players represent requirements, and strategies involve setting up coalitions among the players. In this way we propose a novel model, called decomposition game DG, for attribute-driven design. We present its solution concept based on the notion of cohesion and expansion-freedom and prove that a solution always exists. We then investigate the computational complexity of obtaining a solution. The game model and the algorithms may serve as a general framework for providing useful guidance for software architecture design. We present our results through running examples and a case study on a real-life software project. |
Year | DOI | Venue |
---|---|---|
2015 | 10.1007/978-3-319-25150-9_26 | International Colloquium on Theoretical Aspects of Computing |
Keywords | Field | DocType |
Software architecture,Coalition game,Decomposition game | Software design,Software design description,Software engineering,Computer science,Software architecture description,Game design,Theoretical computer science,Software architecture,Reference architecture,Resource-oriented architecture,Game testing,Management science | Journal |
Volume | ISSN | Citations |
abs/1508.02812 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 5 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jiamou Liu | 1 | 49 | 23.19 |
Ziheng Wei | 2 | 8 | 6.92 |