{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:33Z","timestamp":1761610113625,"version":"build-2065373602"},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3954,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s1571-0661(04)80538-3","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"15-34","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":9,"special_numbering":"C","title":["Model Checking Games"],"prefix":"10.1016","volume":"67","author":[{"given":"Erich","family":"Gr\u00e4del","sequence":"first","affiliation":[]}],"member":"78","reference":[{"year":"2001","series-title":"\u201cRudiments of \u03bc-calculus\u201d","author":"Arnold","key":"10.1016\/S1571-0661(04)80538-3_NEWBIB1"},{"key":"10.1016\/S1571-0661(04)80538-3_NEWBIB2","series-title":"Handbook of Process Algebra","first-page":"293","article-title":"Modal logics and mu-calculi","author":"Bradfield","year":"2001"},{"key":"10.1016\/S1571-0661(04)80538-3_NEWBIB3","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","article-title":"Linear-time algorithms for testing the satisfiability of propositional horn formulae","volume":"1","author":"Dowling","year":"1984","journal-title":"LOGIC PROGRAM. (USA) ISSN: 0743-1066"},{"key":"10.1016\/S1571-0661(04)80538-3_NEWBIB4","doi-asserted-by":"crossref","unstructured":"Dziembowski S., Bounded-variable fixpoint queries are PSPACE-complete, in: 10th Annual Conference on Computer Science Logic CSL 96. Selected papers, Lecture Notes in Computer Science 1258, Springer, 1996 pp. 89\u2013105.","DOI":"10.1007\/3-540-63172-0_34"},{"key":"10.1016\/S1571-0661(04)80538-3_NEWBIB5","doi-asserted-by":"crossref","unstructured":"Emerson A. and C. Jutla, Tree automata, mu-calculus and determinacy, in: Proc. 32nd IEEE Symp. on Foundations of Computer Science, 1991, pp. 368\u2013377.","DOI":"10.1109\/SFCS.1991.185392"},{"key":"10.1016\/S1571-0661(04)80538-3_NEWBIB6","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0304-3975(98)00308-9","article-title":"On logics with two variables","volume":"224","author":"Gr\u00e4del","year":"1999","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80538-3_NEWBIB7","series-title":"P-Completeness Theory\u201d","article-title":"\u201cLimits to Parallel Computation","author":"Greenlaw","year":"1995"},{"key":"10.1016\/S1571-0661(04)80538-3_NEWBIB8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0743-1066(87)90014-8","article-title":"Unification as a complexity measure for logic programming","volume":"4","author":"Itai","year":"1987","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S1571-0661(04)80538-3_NEWBIB9","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0020-0190(98)00150-1","article-title":"Deciding the winner in parity games is in UP \u2229 Co-UP","volume":"68","author":"Jurdzi\u0144ski","year":"1998","journal-title":"Information Processing Letters"},{"key":"10.1016\/S1571-0661(04)80538-3_NEWBIB10","doi-asserted-by":"crossref","unstructured":"Jurdzi\u0144ski M., Small progress measures for solving parity games, in: STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings, Lecture Notes in Computer Science 1770 (2000), pp. 290\u2013301.","DOI":"10.1007\/3-540-46541-3_24"},{"key":"10.1016\/S1571-0661(04)80538-3_NEWBIB11","doi-asserted-by":"crossref","first-page":"336","DOI":"10.2307\/1971035","article-title":"Borel determinacy","volume":"102","author":"Martin","year":"1975","journal-title":"Annals of Mathematics"},{"key":"10.1016\/S1571-0661(04)80538-3_NEWBIB12","doi-asserted-by":"crossref","unstructured":"Thomas W., On the synthesis of strategies in infinite games, in: Proceedings of STACS 95, Lecture Notes in Computer Science Nr. 900 (1995), pp. 1\u201313.","DOI":"10.1007\/3-540-59042-0_57"},{"key":"10.1016\/S1571-0661(04)80538-3_NEWBIB13","first-page":"389","article-title":"Languages, automata, and logic","volume":"Volume 3","author":"Thomas","year":"1997"},{"key":"10.1016\/S1571-0661(04)80538-3_NEWBIB14","doi-asserted-by":"crossref","unstructured":"Vardi M., The complexity of relational query languages, in: Proceedings of the 14th ACM Symposium on the Theory of Computing, 1982, pp. 137\u2013146.","DOI":"10.1145\/800070.802186"},{"key":"10.1016\/S1571-0661(04)80538-3_NEWBIB15","doi-asserted-by":"crossref","unstructured":"Vardi M., On the complexity of bounded-variable queries, in: Proc. 14th ACM Symp. on Principles of Database Systems, 1995, pp. 266\u2013267.","DOI":"10.1145\/212433.212474"},{"key":"10.1016\/S1571-0661(04)80538-3_NEWBIB16","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0304-3975(98)00009-7","article-title":"Infinite games on finitely coloured graphs with applications to automata on infinite trees","volume":"200","author":"Zielonka","year":"1998","journal-title":"Theoretical Computer Science"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805383?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805383?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:05:17Z","timestamp":1761609917000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104805383"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":16,"alternative-id":["S1571066104805383"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80538-3","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2002,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Model Checking Games","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80538-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}