Probabilistic Model Checking for Feature-oriented Systems
Research output: Contribution to book/Conference proceedings/Anthology/Report › Chapter in book/Anthology/Report › Contributed › peer-review
Contributors
Abstract
Within product lines, collections of several related products are defined through their commonalities in terms of features rather than specifying them individually one-by-one. In this paper we present a compositional framework for modeling dynamic product lines by a state-based formalism with both probabilistic and nondeterministic behaviors. Rules for feature changes in products made during runtime are formalized by a coordination component imposing constraints on possible feature activations and deactivations. Our framework supports large-scaled product lines described through multi-features, i.e., where products may involve multiple instances of a feature.
To establish temporal properties for products in a product line, verification techniques have to face a combinatorial blow-up that arises when reasoning about several feature combinations. This blow-up can be avoided by family-based approaches exploiting common feature behaviors. We adapt such approaches to our framework, allowing for a quantitative analysis in terms of probabilistic model checking to reason, e.g., about energy and memory consumption, monetary costs, or the reliability of products. Our framework can also be used to compute strategies how to trigger feature changes for optimizing quantitative objectives using probabilistic model-checking techniques.
We present a natural and conceptually simple translation of product lines into the input language of the prominent probabilistic model checker PRISM
and show feasibility of this translation within a case study on an energy-aware server platform product line comprising thousands of products. To cope with the arising complexity, we follow the family-based analysis scheme and apply symbolic methods for a compact state-space representation.
To establish temporal properties for products in a product line, verification techniques have to face a combinatorial blow-up that arises when reasoning about several feature combinations. This blow-up can be avoided by family-based approaches exploiting common feature behaviors. We adapt such approaches to our framework, allowing for a quantitative analysis in terms of probabilistic model checking to reason, e.g., about energy and memory consumption, monetary costs, or the reliability of products. Our framework can also be used to compute strategies how to trigger feature changes for optimizing quantitative objectives using probabilistic model-checking techniques.
We present a natural and conceptually simple translation of product lines into the input language of the prominent probabilistic model checker PRISM
and show feasibility of this translation within a case study on an energy-aware server platform product line comprising thousands of products. To cope with the arising complexity, we follow the family-based analysis scheme and apply symbolic methods for a compact state-space representation.
Details
Original language | English |
---|---|
Title of host publication | Transactions on Aspect-Oriented Software Development XII |
Editors | Shigeru Chiba, Éric Tanter, Erik Ernst, Robert Hirschfeld |
Publisher | Springer, Berlin [u. a.] |
Pages | 180-220 |
Number of pages | 41 |
ISBN (print) | 978-3-662-46733-6 |
Publication status | Published - 2015 |
Peer-reviewed | Yes |
Publication series
Series | Lecture Notes in Computer Science, Volume 8989 |
---|---|
ISSN | 0302-9743 |
External IDs
Scopus | 84925625865 |
---|---|
ORCID | /0000-0002-5321-9343/work/142236669 |
ORCID | /0000-0003-1724-2586/work/165453576 |
Keywords
Keywords
- Probabilistic Model Checking, Feature-Oriented Systems