TY - GEN
T1 - Reasoning with optional and preferred requirements
AU - Ernst, Neil A.
AU - Mylopoulos, John
AU - Borgida, Alex
AU - Jureta, Ivan J.
PY - 2010
Y1 - 2010
N2 - Of particular concern in requirements engineering is the selection of requirements to implement in the next release of a system. To that end, there has been recent work on multi-objective optimization and user-driven prioritization to support the analysis of requirements trade-offs. Such work has focused on simple, linear models of requirements; in this paper, we work with large models of interacting requirements. We present techniques for selecting sets of solutions to a requirements problem consisting of mandatory and optional goals, with preferences among them. To find solutions, we use a modified version of the framework from Sebastiani et al.[1] to label our requirements goal models. For our framework to apply to a problem, no numeric valuations are necessary, as the language is qualitative. We conclude by introducing a local search technique for navigating the exponential solution space. The algorithm is scalable and approximates the results of a naive but intractable algorithm.
AB - Of particular concern in requirements engineering is the selection of requirements to implement in the next release of a system. To that end, there has been recent work on multi-objective optimization and user-driven prioritization to support the analysis of requirements trade-offs. Such work has focused on simple, linear models of requirements; in this paper, we work with large models of interacting requirements. We present techniques for selecting sets of solutions to a requirements problem consisting of mandatory and optional goals, with preferences among them. To find solutions, we use a modified version of the framework from Sebastiani et al.[1] to label our requirements goal models. For our framework to apply to a problem, no numeric valuations are necessary, as the language is qualitative. We conclude by introducing a local search technique for navigating the exponential solution space. The algorithm is scalable and approximates the results of a naive but intractable algorithm.
UR - http://www.scopus.com/inward/record.url?scp=78649941694&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78649941694&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-16373-9_9
DO - 10.1007/978-3-642-16373-9_9
M3 - Conference contribution
AN - SCOPUS:78649941694
SN - 3642163726
SN - 9783642163722
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 118
EP - 131
BT - Conceptual Modeling, ER 2010 - 29th International Conference on Conceptual Modeling, Proceedings
T2 - 29th International Conference on Conceptual Modeling, ER 2010
Y2 - 1 November 2010 through 4 November 2010
ER -