Advertisement

Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus

  • Cătălin Dima
  • Bastien Maubert
  • Sophie Pinchinat
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9234)

Abstract

We revisit Janin and Walukiewicz’s classic result on the expressive completeness of the modal mu-calculus w.r.t. MSO, when transition systems are equipped with a binary relation over paths. We obtain two natural extensions of MSO and the mu-calculus: MSOwith path relation and the jumping mu-calculus. While “bounded-memory” binary relations bring about no extra expressivity to either of the two logics, “unbounded-memory” binary relations make the bisimulation-invariant fragment of MSO with path relation more expressive than the jumping mu-calculus: the existence of winning strategies in games with imperfect-information inhabits the gap.

Keywords

Transition System Binary Relation Imperfect Information Winning Strategy Atomic Proposition 
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.

References

  1. 1.
    Alur, R., Černý, P., Chaudhuri, S.: Model checking on trees with path equivalences. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 664–678. Springer, Heidelberg (2007) CrossRefGoogle Scholar
  2. 2.
    Apt, K.R., Grädel, E.: Lectures in Game Theory for Computer Scientists. Cambridge University Press, Cambridge (2011)CrossRefzbMATHGoogle Scholar
  3. 3.
    Berstel, J.: Transductions and Context-free Languages, vol. 4. Teubner, Stuttgart (1979)CrossRefzbMATHGoogle Scholar
  4. 4.
    Berwanger, D., Chatterjee, K., De Wulf, M., Doyen, L., Henzinger, T.A.: Strategy construction for parity games with imperfect information. Inf. Comput. 208(10), 1206–1220 (2010)CrossRefzbMATHGoogle Scholar
  5. 5.
    Berwanger, D., Kaiser, L.: Information tracking in games on graphs. J. Logic Lang. Inf. 19(4), 395–412 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Berwanger, D., Mathew, A.B.: Games with recurring certainty. In: Proceedings of SR Games with Recurring Certainty 2014, pp. 91–96 (2014)Google Scholar
  7. 7.
    Bozianu, R., Dima, C., Enea, C.: Model checking an epistemic mu-calculus with synchronous and perfect recall semantics. In: TARK 2013 (2013)Google Scholar
  8. 8.
    Caucal, D.: On infinite transition graphs having a decidable monadic theory. Theor. Comput. Sci. 290(1), 79–115 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Chatterjee, K., Doyen, L.: The complexity of partial-observation parity games. In: Fermüller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol. 6397, pp. 1–14. Springer, Heidelberg (2010) CrossRefGoogle Scholar
  10. 10.
    Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach. Cambridge University Press, Cambridge (2012)CrossRefzbMATHGoogle Scholar
  11. 11.
    Elgot, C.C., Rabin, M.O.: Decidability and undecidability of extensions of second (first) order theory of (generalized) successor. J. Symb. Log. 31(2), 169–181 (1966)CrossRefzbMATHGoogle Scholar
  12. 12.
    Fagin, R., Halpern, J., Moses, Y., Vardi, M.: Reasoning about knowledge. The MIT Press, Boston (2004) Google Scholar
  13. 13.
    Grädel, E.: Model-checking games for logics of imperfect information. Theor. Comput. Sci. 493, 2–14 (2013)CrossRefzbMATHGoogle Scholar
  14. 14.
    Farwer, B.: 1 omega-Automata. In: Grädel, E., Thomas, W., Wilke, T. (eds.) Automata, Logics, and Infinite Games. LNCS, vol. 2500, pp. 3–21. Springer, Heidelberg (2002) CrossRefGoogle Scholar
  15. 15.
    Halpern, J.Y., van der Meyden, R., Vardi, M.Y.: Complete axiomatizations for reasoning about knowledge and time. SIAM J. Comput. 33(3), 674–703 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Halpern, J.Y., Vardi, M.Y.: The complexity of reasoning about knowledge and time. 1. Lower bounds. J. Comp. Sys. Sci. 38(1), 195–237 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Janin, D., Walukiewicz, I.: On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119. Springer, Heidelberg (1996) Google Scholar
  18. 18.
    Matz, O., Schweikardt, N., Thomas, W.: The monadic quantifier alternation hierarchy over grids and graphs. Inf. Comput. 179(2), 356–383 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Maubert, B., Pinchinat, S.: Jumping automata for uniform strategies. In: Proceedings of FSTTCS 2013, pp. 287–298 (2013)Google Scholar
  20. 20.
    Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) Proceedings of 5th GI Conference on Theoretical Computer Science. Lecture Notes in Computer Science, vol. 104, pp. 167–183. Springer, Heidelberg (1981)CrossRefGoogle Scholar
  21. 21.
    Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: POPL 1989, pp. 179–190. ACM Press (1989)Google Scholar
  22. 22.
    Puchala, B.: Asynchronous omega-regular games with partial information. In: Hliněný, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 592–603. Springer, Heidelberg (2010) CrossRefGoogle Scholar
  23. 23.
    Reiter, F.: Distributed graph automata. CoRR: abs/1404.6503 (2014)
  24. 24.
    Shilov, N.V., Garanina, N.O.: Combining knowledge and fixpoints. Technical report Preprint n.98, A.P. Ershov Institute of Informatics Systems, Novosibirsk 2002. http://www.iis.nsk.su/files/preprints/098.pdf
  25. 25.
    Thomas, W.: Infinite trees and automaton-definable relations over omega-words. Theor. Comput. Sci. 103(1), 143–159 (1992)CrossRefzbMATHGoogle Scholar
  26. 26.
    Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages: Volume 3 Beyond Words, pp. 389–455. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  27. 27.
    van der Meyden, R., Shilov, N.V.: Model checking knowledge and time in systems with perfect recall. In: Pandu Rangan, C., Raman, V., Sarukkai, S. (eds.) FST TCS 1999. LNCS, vol. 1738, pp. 432–445. Springer, Heidelberg (1999) CrossRefGoogle Scholar
  28. 28.
    Vardi, M.Y.: Reasoning about the past with two-way automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 628–641. Springer, Heidelberg (1998) CrossRefGoogle Scholar
  29. 29.
    Walukiewicz, I.: Monadic second-order logic on tree-like structures. Theor. Comput. Sci. 275(1–2), 311–346 (2002)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  • Cătălin Dima
    • 1
  • Bastien Maubert
    • 2
  • Sophie Pinchinat
    • 3
  1. 1.Université Paris Est, LACLCréteilFrance
  2. 2.LORIA - CNRS / Université de LorraineNancyFrance
  3. 3.IRISAUniversité de Rennes 1RennesFrance

Personalised recommendations