The Game-Theoretic Framework

Stéphane Demri, Valentin Goranko, Martin LangeCambridge 2016 · DOI · OpenAlex

Abstract

In this chapter we will develop a game-theoretic approach to themain decision problems for temporal logics. We will present model-checking games and satisfiability-checking games and use them to characterise the model checking and the satisfiability-checking problem for temporal logics. These games are defined by means of an arena on which two players perform plays. The characterisations then relate the model-checking problem, i.e. the question of whether a given state of an interpreted transition system satisfies a temporal formula, to the existence of a winning strategy for the proponent player in the respective modelchecking game. Likewise, the satisfiability problem, asking the question of whether a given temporal formula is satisfiable, corresponds to the question of whether the proponent player has a winning strategy in the respective satisfiability game.
BibTeX
@inproceedings{demri2016game,
  author = {Stéphane Demri and Valentin Goranko and Martin Lange},
  title = {{The Game-Theoretic Framework}},
  booktitle = {Cambridge},
  year = {2016},
  doi = {10.1017/cbo9781139236119.015},
}

Loading related content...

Figure