View source for Publications/fahrenberg.22.scp

{{Publication
| published = true
| date = 2022-11-01
| title = Featured Games
| journal = Science of Computer Programming
| volume = 223
| pages = 102874
| None = Featured transition system, Two-player game, Family-based model checking
| authors = Uli Fahrenberg, Axel Legay
| lrdepaper = http://www.lrde.epita.fr/dload/papers/fahrenberg.22.scp.pdf
| lrdenewsdate = 2022-11-01
| lrdeprojects = AA
| 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.
| type = article
| id = fahrenberg.22.scp
| identifier = doi:https://doi.org/10.1016/j.scico.2022.102874
| bibtex = 
@Article<nowiki>{</nowiki>	  fahrenberg.22.scp,
  title		= <nowiki>{</nowiki>Featured Games<nowiki>}</nowiki>,
  journal	= <nowiki>{</nowiki>Science of Computer Programming<nowiki>}</nowiki>,
  volume	= 223,
  pages		= 102874,
  year		= 2022,
  issn		= <nowiki>{</nowiki>0167-6423<nowiki>}</nowiki>,
  doi		= <nowiki>{</nowiki>https://doi.org/10.1016/j.scico.2022.102874<nowiki>}</nowiki>,
  url		= <nowiki>{</nowiki>https://www.sciencedirect.com/science/article/pii/S0167642322001071<nowiki>}</nowiki>,
  author	= <nowiki>{</nowiki>Uli Fahrenberg and Axel Legay<nowiki>}</nowiki>,
  keywords	= <nowiki>{</nowiki>Featured transition system, Two-player game, Family-based
		  model checking<nowiki>}</nowiki>,
  month		= nov,
  abstract	= <nowiki>{</nowiki>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.<nowiki>}</nowiki>
<nowiki>}</nowiki>

}}