Game Quantification on Automatic Structures and Hierarchical Model Checking Games

  • Łukasz Kaiser
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4207)


Game quantification is an expressive concept and has been studied in model theory and descriptive set theory, especially in relation to infinitary logics. Automatic structures on the other hand appear very often in computer science, especially in program verification. We extend first-order logic on structures on words by allowing to use an infinite string of alternating quantifiers on letters of a word, the game quantifier. This extended logic is decidable and preserves regularity on automatic structures, but can be undecidable on other structures even with decidable first-order theory. We show that in the presence of game quantifier any relation that allows to distinguish successors is enough to define all regular relations and therefore the game quantifier is strictly more expressive than first-order logic in such cases. Conversely, if there is an automorphism of atomic relations that swaps some successors then we prove that it can be extended to any relations definable with game quantifier. After investigating it’s expressiveness, we use game quantification to introduce a new type of combinatorial games with multiple players and imperfect information exchanged with respect to a hierarchical constraint. It is shown that these games on finite arenas exactly capture the logic with game quantifier when players alternate their moves but are undecidable and not necessarily determined in the other case. In this way we define the first model checking games with finite arenas that can be used for model checking first-order logic on automatic structures.


Model Check Play Action Information Level Imperfect Information Game Quantifier 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Barany, V.: Invariants of Automatic Presentations and Semi-Synchronous transductions. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 289–300. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  2. 2.
    Bradfield, J.C.: Parity of Imperfection or Fixing Independence. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 72–85. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  3. 3.
    Büchi, J.R.: On Decision Method in Restricted Second Order Arithmetic. In: Proceedings of the International Congress on Logic, Methodology and Philosophy of Science, pp. 1–11 (1962)Google Scholar
  4. 4.
    Blumensath, A., Grädel, E.: Finite Presentations of Infinite Structures: Automata and Interpretations. Theory of Computing Systems 37, 641–674 (2004)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Chatterjee, K., Henzinger, T.A.: Semiperfect-Information Games. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 1–18. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  6. 6.
    Emerson, A., Jutla, C.: Tree automata, mucalculus and determinacy. In: Proc. 32nd IEEE Symp. on Foundations of Computer Science, pp. 368–377 (1991)Google Scholar
  7. 7.
    Gale, D., Stewart, F.M.: Infinite Games with Perfect Information. In: Kuhn, H.W., Tucker, A.W. (eds.) Contributions to the Theory of Games. Annals of Mathematics Studies, vol. II, pp. 245–266. Princeton University Press, Princeton (1953)Google Scholar
  8. 8.
    Grädel, E.: Model Checking Games. In: Proceedings of WOLLIC 2002. Electronic Notes in Theoretical Computer Science, vol. 67 (2002)Google Scholar
  9. 9.
    Khoussainov, B., Nerode, A.: Automatic Presentations of Structures. In: Leivant, D. (ed.) LCC 1994. LNCS, vol. 960, pp. 367–392. Springer, Heidelberg (1995)Google Scholar
  10. 10.
    Kolaitis, P.G.: Game Quantification. In: Barwise, J., Feferman, S. (eds.) Model Theoretic Logics, pp. 365–422 (1985)Google Scholar
  11. 11.
    Martin, D.: Borel determinacy. Annals of Mathematics 102, 336–371 (1975)CrossRefGoogle Scholar
  12. 12.
    Miyano, S., Hayashi, T.: Alternating Finite Automata on ω-words. Theoretical Computer Science 32, 321–330 (1984)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Łukasz Kaiser
    • 1
  1. 1.Mathematische Grundlagen der Informatik, RWTH AachenAachenGermany

Personalised recommendations