Backtracking Games and Inflationary Fixed Points
We define a new class of games, called backtracking games. Backtracking games are essentially parity games with an additional rule allowing players, under certain conditions, to return to an earlier position in the play and revise a choice.
This new feature makes backtracking games more powerful than parity games. As a consequence, winning strategies become more complex objects and computationally harder. The corresponding increase in expressiveness allows us to use backtracking games as model checking games for inflationary fixed-point logics such as IFP or MIC. We identify a natural subclass of backtracking games, the simple games, and show that these are the “right” model checking games for IFP by a) giving a translation of formulae φ and structures \(\cal A\) into simple games such that \(\cal A \models \phi\) if, and only if, Player 0 wins the corresponding game and b) showing that the winner of simple backtracking games can again be defined in IFP.
KeywordsModel Check Simple Game Winning Strategy Point Logic Game Graph
Unable to display preview. Download preview PDF.
- 1.Dawar, A., Grädel, E., Kreutzer, S.: Inflationary fixed points in modal logic. ACM Transactions on Computational Logic, TOCL (2003) (accepted for publication)Google Scholar
- 3.Grädel, E.: Finite model theory and descriptive complexity. In: Finite Model Theory and Its Applications, Springer, Heidelberg (2003) (to appear), See http://wwwmgi.informatik.rwth-aachen.de/Publications/pub/graedel/Gr-FMTbook.ps Google Scholar
- 4.Grädel, E., Kreutzer, S.: Will deflation lead to depletion? On non-monotone fixed-point inductions. In: IEEE Symp. of Logic in Computer Science, LICS (2003)Google Scholar
- 6.Kreutzer, S.: Expressive equivalence of least and inflationary fixed-point logic. In: 17th Symp. on Logic in Computer Science (LICS), pp. 403 – 413 (2002)Google Scholar
- 8.Stirling, C.: Bisimulation, model checking and other games. Notes for the Mathfit instructional meeting on games and computation, Edinburgh (1997)Google Scholar
- 9.Walukiewicz, I.: Monadic second order logic on tree-like structures. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol. 1046, pp. 401–414. Springer, Heidelberg (1996)Google Scholar