Probabilistic Model Checking for Energy Analysis in Software Product Lines

Aus International Center for Computational Logic
Version vom 5. März 2025, 14:47 Uhr von Johannes Lehmann (Diskussion | Beiträge) (Textersetzung - „Verifikation und formale quantitative Analyse“ durch „Algebraische und logische Grundlagen der Informatik“)
(Unterschied) ← Nächstältere Version | Aktuelle Version (Unterschied) | Nächstjüngere Version → (Unterschied)
Wechseln zu:Navigation, Suche

Toggle side column

Probabilistic Model Checking for Energy Analysis in Software Product Lines

Clemens DubslaffClemens Dubslaff,  Sascha KlüppelholzSascha Klüppelholz,  Christel BaierChristel Baier
Clemens Dubslaff, Sascha Klüppelholz, Christel Baier
Probabilistic Model Checking for Energy Analysis in Software Product Lines
Proc. of the 13th International Conference on Modularity (MODULARITY), 169--180, 2014. ACM
  • KurzfassungAbstract
    In a software product line (SPL), a collection of software products is defined by their commonalities in terms of features rather than explicitly specifying all products one-by-one. Several verification techniques were adapted to establish temporal properties of SPLs. Symbolic and family-based model checking have been proven to be successful for tackling the combinatorial blow-up arising when reasoning about several feature combinations. However, most formal verification approaches for SPLs presented in the literature focus on the static SPLs, where the features of a product are fixed and cannot be changed during runtime. This is in contrast to dynamic SPLs, allowing to adapt feature combinations of a product dynamically after deployment. The main contribution of the paper is a compositional modeling framework for dynamic SPLs, which supports probabilistic and nondeterministic choices and allows for quantitative analysis. We specify the feature changes during runtime within an automata-based coordination component, enabling to reason over strategies how to trigger dynamic feature changes for optimizing various quantitative objectives, e.g., energy or monetary costs and reliability. For our framework there is a natural and conceptually simple translation into the input language of the prominent probabilistic model checker PRISM. This facilitates the application of PRISM's powerful symbolic engine to the operational behavior of dynamic SPLs and their family-based analysis against various quantitative queries. We demonstrate feasibility of our approach by a case study issuing an energy-aware bonding network device.
  • Forschungsgruppe:Research Group: Algebraische und logische Grundlagen der InformatikAlgebraic and Logical Foundations of Computer Science
@inproceedings{DKB2014,
  author    = {Clemens Dubslaff and Sascha Kl{\"{u}}ppelholz and Christel Baier},
  title     = {Probabilistic Model Checking for Energy Analysis in Software
               Product Lines},
  booktitle = {Proc. of the 13th International Conference on Modularity
               (MODULARITY)},
  publisher = {ACM},
  year      = {2014},
  pages     = {169--180},
  doi       = {10.1145/2577080.2577095}
}