2012
DOI: 10.1109/mc.2012.286
|View full text |Cite
|
Sign up to set email alerts
|

Using Constraint Programming to Manage Configurations in Self-Adaptive Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
34
0
13

Year Published

2013
2013
2024
2024

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 46 publications
(47 citation statements)
references
References 12 publications
0
34
0
13
Order By: Relevance
“…Usually in this planning type, the e®ects of di®erent actions on the adaptation goals are formally de¯ned. Subsequently, the problem of¯nding the most suitable action is reduced to a satis¯ability problem (SAT) [51,69] or a constraint satisfaction problem (CSP) [70][71][72] which is then solved using a SAT-solver or a CSP-solver. For example, in Parra et al [70], a CSP solver is used at runtime to¯nd the most suitable variant of the system which satis¯es the goals of adaptation.…”
Section: Planningmentioning
confidence: 99%
“…Usually in this planning type, the e®ects of di®erent actions on the adaptation goals are formally de¯ned. Subsequently, the problem of¯nding the most suitable action is reduced to a satis¯ability problem (SAT) [51,69] or a constraint satisfaction problem (CSP) [70][71][72] which is then solved using a SAT-solver or a CSP-solver. For example, in Parra et al [70], a CSP solver is used at runtime to¯nd the most suitable variant of the system which satis¯es the goals of adaptation.…”
Section: Planningmentioning
confidence: 99%
“…Details about the transformation rules and an algorithm that transforms feature models into constraint programs can be found in . Details about the transformation of context models into a constraint program and their relationships with variability models are provided in (Sawyer et al, 2012). The composition model is not represented as a constraint program because its relationships with the variability model are implemented by means of the weaving model.…”
Section: Step 52: Define Resolutionsmentioning
confidence: 99%
“…Other research works , Lee and Kang, 2006, Cetina et al, 2009, Sawyer et al, 2012 use variability models to specify the legal combination of requirements to satisfy adaptation needs elicited from a monitoring process. However, they neither deal with verification of SASs nor focus on service compositions.…”
Section: Verification Of Self Adaptive Systemsmentioning
confidence: 99%
“…Also, many real-time systems that need a new system configuration may require optimization before deployment (Cuadrado et al, 2012) and optimization must be performed to satisfy stringent quality requirements. Sawyer et al (2012) suggest representing the dynamic behavior of self-adaptive systems in a DSPL using goal models together with feature models to describe soft constraints for different levels of satisfaction. The optimization in this case is solved as a constraint-programming problem.…”
Section: Runtime Variability Techniquesmentioning
confidence: 99%
“…Potential solution: Although these proposals deal with user decisions, they are limited those that affect features, being unable to represent any decision on quality attributes further than the five satisfaction levels proposed by Sawyer et al (2012). In this solution we propose the use of the so-called Stateful Feature Models, SFMs (Trinidad, 2012) which represent user preferences in terms of features and attributes.…”
Section: Dynamic and Optimized Reconfigurationmentioning
confidence: 99%