Abstract
Parikh’s game logic is a PDL-like fixpoint logic interpreted on monotone neighbourhood frames that represent the strategic power of players in determined two-player games. Game logic translates into a fragment of the monotone \(\mu \)-calculus, which in turn is expressively equivalent to monotone modal automata. Parity games and automata are important tools for dealing with the combinatorial complexity of nested fixpoints in modal fixpoint logics, such as the modal \(\mu \)-calculus. In this paper, we (1) discuss the semantics a of game logic over neighbourhood structures in terms of parity games, and (2) use these games to obtain an automata-theoretic characterisation of the fragment of the monotone \(\mu \)-calculus that corresponds to game logic. Our proof makes extensive use of structures that we call syntax graphs that combine the ease-of-use of syntax trees of formulas with the flexibility and succinctness of automata. They are essentially a graph-based view of the alternating tree automata that were introduced by Wilke in the study of modal \(\mu \)-calculus.
C. Kupke and J. Marti—Supported by EPSRC grant EP/N015843/1.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
It is well-known that \(\mathcal {M}\) is a monad, [14]. Readers who are familiar with monads will recognise that unit and composition correspond to the unit and Kleisli composition.
References
Berwanger, D.: Game logic is strong enough for parity games. Stud. Logica 75(2), 205–219 (2003)
Bradfield, J., Stirling, C.: Modal \(\mu \)-calculi. In: Handbook of Modal Logic, pp. 721–756. Elsevier (2006)
Carreiro, F., Venema, Y.: PDL inside the \(\mu \)-calculus: a syntactic and an automata-theoretic characterization. In: Goré, R., Kooi, B., Kurucz, A. (eds.) Advances in Modal Logic, vol. 10, pp. 74–93. College Publications (2014)
Carreiro, F.: Fragments of fixpoint logics. Ph.D. thesis, University of Amsterdam (2015)
Chellas, B.F.: Modal Logic: An Introduction. Cambridge University Press, Cambridge (1980)
d’Agostino, G., Hollenberg, M.: Logical questions concerning the \(\mu \)-calculus. J. Symbol. Logic 65, 310–332 (2000)
Emerson, E.A., Jutla, C.S.: The complexity of tree automata and logics of programs (extended abstract). In: Proceedings of the 29th Symposium on the Foundations of Computer Science, pp. 328–337. IEEE Computer Society Press (1988)
Emerson, E.A., Jutla, C.S., Sistla, P.: On model checking for the \(\mu \)-calculus and its fragments. Theor. Comput. Sci. 258, 491–522 (2001)
Emerson, E., Jutla, C.: Tree automata, mu-calculus and determinacy. In: Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science (FoCS 1991), pp. 368–377. IEEE (1991)
Enqvist, S., Seifan, F., Venema, Y.: Completeness for \(\mu \)-calculi: a coalgebraic approach. Technical rep. PP-2017-04, ILLC, Universiteit van Amsterdam (2017)
Fontaine, G., Leal, R., Venema, Y.: Automata for coalgebras: an approach using predicate liftings. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 381–392. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-14162-1_32
Grädel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-36387-4
Hansen, H.H.: Monotonic modal logic. Master’s thesis, University of Amsterdam (2003). iLLC Preprint PP-2003-24
Hansen, H.H., Kupke, C.: Weak completeness of coalgebraic dynamic logics. In: Fixed Points in Computer Science (FICS). EPTCS, vol. 191, pp. 90–104 (2015)
Hansen, H., Kupke, C., Marti, J., Venema, Y.: Parity games and automata for game logic (extended version) (2017). http://www.arxiv.org
Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. The MIT Press, Cambridge (2000)
Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)
Janin, D., Walukiewicz, I.: Automata for the modal \(\mu \)-calculus and related results. In: Wiedermann, J., Hájek, P. (eds.) MFCS 1995. LNCS, vol. 969, pp. 552–562. Springer, Heidelberg (1995). https://doi.org/10.1007/3-540-60246-1_160
Kirsten, D.: Alternating tree automata and parity games. In: Grädel, E., Thomas, W., Wilke, T. (eds.) Automata Logics, and Infinite Games. LNCS, vol. 2500, pp. 153–167. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-36387-4_9
Kozen, D.: Results on the propositional \(\mu \)-calculus. Theoret. Comput. Sci. 27, 333–354 (1983)
Madeira, A., Neves, R., Martins, M.: An exercise on the generation of many-valued dynamic logics. J. Logic Algebraic Method Program. 85(5), 1011–1037 (2016)
Mostowski, A.: Games with forbidden positions. Technical rep. 78, Instytut Matematyki, Uniwersytet Gdański, Poland (1991)
Parikh, R.: The logic of games and its applications. In: Topics in the Theory of Computation. Annals of Discrete Mathematics, vol. 14. Elsevier (1985)
Pauly, M.: Logic for social software. Ph.D. thesis, University of Amsterdam (2001)
Pauly, M., Parikh, R.: Game logic: an overview. Stud. Logica 75(2), 165–182 (2003)
Venema, Y.: Lectures on the modal \(\mu \)-calculus (2012). https://staff.science.uva.nl/y.venema/
Walukiewicz, I.: On completeness of the mu-calculus. In: Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS 1993), pp. 136–146. IEEE Computer Society (1993)
Walukiewicz, I.: Completeness of Kozen’s axiomatisation of the propositional \(\mu \)-calculus. Inf. Comput. 157(1–2), 142–182 (2000). LICS 1995. San Diego, CA
Wilke, T.: Alternating tree automata, parity games, and modal \(\mu \)-calculus. Bull. Belg. Math. Soc. 8, 359–391 (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Hansen, H.H., Kupke, C., Marti, J., Venema, Y. (2018). Parity Games and Automata for Game Logic. In: Madeira, A., Benevides, M. (eds) Dynamic Logic. New Trends and Applications. DALI 2017. Lecture Notes in Computer Science(), vol 10669. Springer, Cham. https://doi.org/10.1007/978-3-319-73579-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-73579-5_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-73578-8
Online ISBN: 978-3-319-73579-5
eBook Packages: Computer ScienceComputer Science (R0)