{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:42:21Z","timestamp":1762101741942,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662480564"},{"type":"electronic","value":"9783662480571"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48057-1_14","type":"book-chapter","created":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T01:29:54Z","timestamp":1439170194000},"page":"179-191","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus"],"prefix":"10.1007","author":[{"given":"C\u0103t\u0103lin","family":"Dima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bastien","family":"Maubert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sophie","family":"Pinchinat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,11]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1007\/978-3-540-71209-1_51","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R Alur","year":"2007","unstructured":"Alur, R., \u010cern\u00fd, P., Chaudhuri, S.: Model checking on trees with path equivalences. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 664\u2013678. Springer, Heidelberg (2007)"},{"key":"14_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511973468","volume-title":"Lectures in Game Theory for Computer Scientists","author":"KR Apt","year":"2011","unstructured":"Apt, K.R., Gr\u00e4del, E.: Lectures in Game Theory for Computer Scientists. Cambridge University Press, Cambridge (2011)"},{"key":"14_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and Context-free Languages","author":"J Berstel","year":"1979","unstructured":"Berstel, J.: Transductions and Context-free Languages, vol. 4. Teubner, Stuttgart (1979)"},{"issue":"10","key":"14_CR4","doi-asserted-by":"publisher","first-page":"1206","DOI":"10.1016\/j.ic.2009.09.006","volume":"208","author":"D Berwanger","year":"2010","unstructured":"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\u20131220 (2010)","journal-title":"Inf. Comput."},{"issue":"4","key":"14_CR5","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s10849-009-9115-8","volume":"19","author":"D Berwanger","year":"2010","unstructured":"Berwanger, D., Kaiser, L.: Information tracking in games on graphs. J. Logic Lang. Inf. 19(4), 395\u2013412 (2010)","journal-title":"J. Logic Lang. Inf."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Berwanger, D., Mathew, A.B.: Games with recurring certainty. In: Proceedings of SR Games with Recurring Certainty 2014, pp. 91\u201396 (2014)","DOI":"10.4204\/EPTCS.146.12"},{"key":"14_CR7","unstructured":"Bozianu, R., Dima, C., Enea, C.: Model checking an epistemic mu-calculus with synchronous and perfect recall semantics. In: TARK 2013 (2013)"},{"issue":"1","key":"14_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0304-3975(01)00089-5","volume":"290","author":"D Caucal","year":"2003","unstructured":"Caucal, D.: On infinite transition graphs having a decidable monadic theory. Theor. Comput. Sci. 290(1), 79\u2013115 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-16242-8_1","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"K Chatterjee","year":"2010","unstructured":"Chatterjee, K., Doyen, L.: The complexity of partial-observation parity games. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol. 6397, pp. 1\u201314. Springer, Heidelberg (2010)"},{"key":"14_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511977619","volume-title":"Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach","author":"B Courcelle","year":"2012","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach. Cambridge University Press, Cambridge (2012)"},{"issue":"2","key":"14_CR11","doi-asserted-by":"publisher","first-page":"169","DOI":"10.2307\/2269808","volume":"31","author":"CC Elgot","year":"1966","unstructured":"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\u2013181 (1966)","journal-title":"J. Symb. Log."},{"key":"14_CR12","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5803.001.0001","volume-title":"Reasoning about knowledge","author":"R Fagin","year":"2004","unstructured":"Fagin, R., Halpern, J., Moses, Y., Vardi, M.: Reasoning about knowledge. The MIT Press, Boston (2004)"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2012.10.033","volume":"493","author":"E Gr\u00e4del","year":"2013","unstructured":"Gr\u00e4del, E.: Model-checking games for logics of imperfect information. Theor. Comput. Sci. 493, 2\u201314 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/3-540-36387-4_1","volume-title":"Automata, Logics, and Infinite Games: A Guide to Current Research","author":"B Farwer","year":"2002","unstructured":"Farwer, B.: 1 omega-Automata. In: Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.) Automata, Logics, and Infinite Games. LNCS, vol. 2500, pp. 3\u201321. Springer, Heidelberg (2002)"},{"issue":"3","key":"14_CR15","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1137\/S0097539797320906","volume":"33","author":"JY Halpern","year":"2004","unstructured":"Halpern, J.Y., van der Meyden, R., Vardi, M.Y.: Complete axiomatizations for reasoning about knowledge and time. SIAM J. Comput. 33(3), 674\u2013703 (2004)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"14_CR16","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-0000(89)90039-1","volume":"38","author":"JY Halpern","year":"1989","unstructured":"Halpern, J.Y., Vardi, M.Y.: The complexity of reasoning about knowledge and time. 1. Lower bounds. J. Comp. Sys. Sci. 38(1), 195\u2013237 (1989)","journal-title":"J. Comp. Sys. Sci."},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR \u201996: Concurrency Theory","author":"D Janin","year":"1996","unstructured":"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)"},{"issue":"2","key":"14_CR18","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1006\/inco.2002.2955","volume":"179","author":"O Matz","year":"2002","unstructured":"Matz, O., Schweikardt, N., Thomas, W.: The monadic quantifier alternation hierarchy over grids and graphs. Inf. Comput. 179(2), 356\u2013383 (2002)","journal-title":"Inf. Comput."},{"key":"14_CR19","unstructured":"Maubert, B., Pinchinat, S.: Jumping automata for uniform strategies. In: Proceedings of FSTTCS 2013, pp. 287\u2013298 (2013)"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Proceedings of 5th GI Conference on Theoretical Computer Science","author":"D Park","year":"1981","unstructured":"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\u2013183. Springer, Heidelberg (1981)"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: POPL 1989, pp. 179\u2013190. ACM Press (1989)","DOI":"10.1145\/75277.75293"},{"key":"14_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/978-3-642-15155-2_52","volume-title":"Mathematical Foundations of Computer Science 2010","author":"B Puchala","year":"2010","unstructured":"Puchala, B.: Asynchronous omega-regular games with partial information. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 592\u2013603. Springer, Heidelberg (2010)"},{"key":"14_CR23","unstructured":"Reiter, F.: Distributed graph automata. CoRR: abs\/1404.6503 (2014)"},{"key":"14_CR24","unstructured":"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"},{"issue":"1","key":"14_CR25","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0304-3975(92)90090-3","volume":"103","author":"W Thomas","year":"1992","unstructured":"Thomas, W.: Infinite trees and automaton-definable relations over omega-words. Theor. Comput. Sci. 103(1), 143\u2013159 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR26","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Languages: Volume 3 Beyond Words","author":"W Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages: Volume 3 Beyond Words, pp. 389\u2013455. Springer, Heidelberg (1997)"},{"key":"14_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/3-540-46691-6_35","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"R van der Meyden","year":"1999","unstructured":"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\u2013445. Springer, Heidelberg (1999)"},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/BFb0055090","volume-title":"Automata, Languages and Programming","author":"MY Vardi","year":"1998","unstructured":"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\u2013641. Springer, Heidelberg (1998)"},{"issue":"1\u20132","key":"14_CR29","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0304-3975(01)00185-2","volume":"275","author":"I Walukiewicz","year":"2002","unstructured":"Walukiewicz, I.: Monadic second-order logic on tree-like structures. Theor. Comput. Sci. 275(1\u20132), 311\u2013346 (2002)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2015"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48057-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T06:16:15Z","timestamp":1676960175000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-48057-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662480564","9783662480571"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48057-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"11 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}