Difference between revisions of "Publications/fahrenberg.22.scp"
From LRDE
(Created page with "{{Publication | published = true | date = 2022-11-01 | title = Featured Games | journal = Science of Computer Programming | volume = 223 | pages = 102874 | None = Featured tra...") |
|||
Line 19: | Line 19: | ||
title = <nowiki>{</nowiki>Featured Games<nowiki>}</nowiki>, |
title = <nowiki>{</nowiki>Featured Games<nowiki>}</nowiki>, |
||
journal = <nowiki>{</nowiki>Science of Computer Programming<nowiki>}</nowiki>, |
journal = <nowiki>{</nowiki>Science of Computer Programming<nowiki>}</nowiki>, |
||
− | volume = |
+ | volume = 223, |
− | pages = |
+ | pages = 102874, |
− | year = |
+ | year = 2022, |
issn = <nowiki>{</nowiki>0167-6423<nowiki>}</nowiki>, |
issn = <nowiki>{</nowiki>0167-6423<nowiki>}</nowiki>, |
||
doi = <nowiki>{</nowiki>https://doi.org/10.1016/j.scico.2022.102874<nowiki>}</nowiki>, |
doi = <nowiki>{</nowiki>https://doi.org/10.1016/j.scico.2022.102874<nowiki>}</nowiki>, |
||
Line 28: | Line 28: | ||
keywords = <nowiki>{</nowiki>Featured transition system, Two-player game, Family-based |
keywords = <nowiki>{</nowiki>Featured transition system, Two-player game, Family-based |
||
model checking<nowiki>}</nowiki>, |
model checking<nowiki>}</nowiki>, |
||
+ | month = nov, |
||
abstract = <nowiki>{</nowiki>Feature-based analysis of software product lines and |
abstract = <nowiki>{</nowiki>Feature-based analysis of software product lines and |
||
family-based model checking have seen rapid development. |
family-based model checking have seen rapid development. |
Latest revision as of 09:49, 21 December 2022
- Authors
- Uli Fahrenberg, Axel Legay
- Journal
- Science of Computer Programming
- Type
- article
- Projects
- AA"AA" is not in the list (Vaucanson, Spot, URBI, Olena, APMC, Tiger, Climb, Speaker ID, Transformers, Bison, ...) of allowed values for the "Related project" property.
- Date
- 2022-11-01
Abstract
Feature-based analysis of software product lines and family-based model checking have seen rapid development. Many model checking problems can be reduced to two-player games on finite graphs. A prominent example is mu-calculus model checking, which is generally done by translating to parity games, but also many quantitative model-checking problems can be reduced to (quantitative) games. As part of a program to make game-based model checking available for software product lines, we introduce featured reachability games, featured minimum reachability games, featured discounted games, featured energy games, and featured parity games. We show that all these admit optimal featured strategies, which project to optimal strategies for any product, and how to compute winners and values of such games in a family-based manner.
Documents
Bibtex (lrde.bib)
@Article{ fahrenberg.22.scp, title = {Featured Games}, journal = {Science of Computer Programming}, volume = 223, pages = 102874, year = 2022, issn = {0167-6423}, doi = {https://doi.org/10.1016/j.scico.2022.102874}, url = {https://www.sciencedirect.com/science/article/pii/S0167642322001071}, author = {Uli Fahrenberg and Axel Legay}, keywords = {Featured transition system, Two-player game, Family-based model checking}, month = nov, abstract = {Feature-based analysis of software product lines and family-based model checking have seen rapid development. Many model checking problems can be reduced to two-player games on finite graphs. A prominent example is mu-calculus model checking, which is generally done by translating to parity games, but also many quantitative model-checking problems can be reduced to (quantitative) games. As part of a program to make game-based model checking available for software product lines, we introduce featured reachability games, featured minimum reachability games, featured discounted games, featured energy games, and featured parity games. We show that all these admit optimal featured strategies, which project to optimal strategies for any product, and how to compute winners and values of such games in a family-based manner.} }