{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:10:52Z","timestamp":1761610252648,"version":"build-2065373602"},"reference-count":10,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"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":3831,"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":[[2003,2]]},"DOI":"10.1016\/s1571-0661(04)80534-6","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"71-84","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":16,"title":["Uniform Solution of Parity Games on Prefix-Recognizable Graphs"],"prefix":"10.1016","volume":"68","author":[{"given":"Thierry","family":"Cachat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80534-6_NEWBIB1","first-page":"704","article-title":"Symbolic Strategy Synthesis for Games on Pushdown Graphs","author":"CACHAT","year":"2002","journal-title":"ICALP'02, LNCS 2380"},{"key":"10.1016\/S1571-0661(04)80534-6_NEWBIB2","first-page":"194","article-title":"On infinite transition graphs having a decidable monadic theory","author":"CAUCAL","year":"1996","journal-title":"ICALP'96, LNCS 1099"},{"key":"10.1016\/S1571-0661(04)80534-6_NEWBIB3","first-page":"177","article-title":"On the transition graphs of Turing machines","author":"CAUCAL","year":"2001","journal-title":"3rd MCU, LNCS 2055"},{"key":"10.1016\/S1571-0661(04)80534-6_NEWBIB4","series-title":"FoCS'91","first-page":"368","article-title":"Tree automata, mu-calculus and determinacy","author":"EMERSON","year":"1991"},{"key":"10.1016\/S1571-0661(04)80534-6_NEWBIB5","first-page":"385","article-title":"On model-checking for fragments of \u03bc-calculus","author":"EMERSON","year":"1993","journal-title":"CAV'93, LNCS 697"},{"key":"10.1016\/S1571-0661(04)80534-6_NEWBIB6","first-page":"36","article-title":"An Automata-Theoretic Approach to Reasoning about Infinite-State Systems","author":"KUPFERMAN","year":"2000","journal-title":"CAV'00, LNCS 1855"},{"doi-asserted-by":"crossref","unstructured":"O. SERRE, Note on Winning Positions on Pushdown Games with Omega-Regular Conditions, to appear in Information Processing Letter, 2002. available at http:\/\/www.liafa.jussieu.fr\/~serre\/recherche.html.","key":"10.1016\/S1571-0661(04)80534-6_NEWBIB7","DOI":"10.1016\/S0020-0190(02)00445-3"},{"key":"10.1016\/S1571-0661(04)80534-6_NEWBIB8","first-page":"628","article-title":"Reasoning about the past with two-way automata","author":"VARDI","year":"1998","journal-title":"ICALP'98, LNCS 1443"},{"key":"10.1016\/S1571-0661(04)80534-6_NEWBIB9","first-page":"202","article-title":"A discrete strategy improvement algorithm for solving parity games","author":"V\u00d6GE","year":"2000","journal-title":"CAV'00, LNCS 1855"},{"key":"10.1016\/S1571-0661(04)80534-6_NEWBIB10","first-page":"62","article-title":"Pushdown processes: games and model checking","author":"WALUKIEWICZ","year":"1996","journal-title":"CAV'96, LNCS 1102"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805346?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805346?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:58Z","timestamp":1761609958000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104805346"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S1571066104805346"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80534-6","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2003,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Uniform Solution of Parity Games on Prefix-Recognizable Graphs","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)80534-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}