{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T21:15:52Z","timestamp":1779138952078,"version":"3.51.4"},"reference-count":20,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6194,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,8]]},"DOI":"10.1016\/0304-3975(95)00136-0","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"99-116","source":"Crossref","is-referenced-by-count":72,"title":["Games for the \u03bc-calculus"],"prefix":"10.1016","volume":"163","author":[{"given":"Damian","family":"Niwi\u0144ski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Walukiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00136-0_BIB1","series-title":"Proc. CAAP'92","first-page":"145","article-title":"CTL\u2217 and ECTL\u2217 as a fragments of the modal \u03bc-calculus","volume":"Vol. 581","author":"Dam","year":"1992"},{"key":"10.1016\/0304-3975(95)00136-0_BIB2","series-title":"Proc. 7th Internat. Coll. on Automata, Languages and Programming","first-page":"169","article-title":"Characterizing correctness properties of parallel programs using fixpoints","author":"Emerson","year":"1980"},{"key":"10.1016\/0304-3975(95)00136-0_BIB3","series-title":"Proc. 29th IEEE Symp. on Foundations of Computer Science","article-title":"The complexity of tree automata and logics of programs","author":"Emerson","year":"1988"},{"key":"10.1016\/0304-3975(95)00136-0_BIB4","series-title":"Proc. LICS'89","article-title":"On simultaneously determinizing and complementing \u03c9-automata","author":"Emerson","year":"1989"},{"key":"10.1016\/0304-3975(95)00136-0_BIB5","series-title":"Proc. FOCS 91","article-title":"Tree automata, mu calculus and determinacy","author":"Emerson","year":"1991"},{"key":"10.1016\/0304-3975(95)00136-0_BIB6","doi-asserted-by":"crossref","unstructured":"M.J. Fisher and R.E. Ladner, Propositional dynamic logic of regular programs, J. Comput. System Sci. 18 (2979) 194\u2013211.","DOI":"10.1016\/0022-0000(79)90046-1"},{"key":"10.1016\/0304-3975(95)00136-0_BIB7","article-title":"Trees, automata and games","author":"Gurevich","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(95)00136-0_BIB8","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","article-title":"Results on the propositional \u03bc-calculus","volume":"27","author":"Kozen","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00136-0_BIB9","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0304-3975(81)90019-0","article-title":"An elementary proof of the completeness of the PDL","volume":"14","author":"Kozen","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00136-0_BIB10","doi-asserted-by":"crossref","first-page":"363","DOI":"10.2307\/1971035","article-title":"Borel determinacy","volume":"102","author":"Martin","year":"1975","journal-title":"Ann. Math."},{"key":"10.1016\/0304-3975(95)00136-0_BIB11","article-title":"Descriptive Set Theory","volume":"Vol. 100","author":"Moschovakis","year":"1980"},{"key":"10.1016\/0304-3975(95)00136-0_BIB12","first-page":"17","article-title":"Games on infinite trees and automata with dead ends","volume":"24","author":"Muchnik","year":"1984","journal-title":"Semiotics and Information"},{"key":"10.1016\/0304-3975(95)00136-0_BIB13","first-page":"59","article-title":"Fixpoint inductinon and proof of program semantics","volume":"Vol. 5","author":"Park","year":"1970"},{"key":"10.1016\/0304-3975(95)00136-0_BIB14","series-title":"Proc. 29th IEEE Symp. on Foundations of Computer Science","article-title":"On the complexity of \u03c9-automata","author":"Safra","year":"1988"},{"key":"10.1016\/0304-3975(95)00136-0_BIB15","doi-asserted-by":"crossref","unstructured":"C. Stirling, Modal and temporal logics for processes, Lecture Notes in Computer Science, to appear.","DOI":"10.1007\/3-540-60915-6_5"},{"key":"10.1016\/0304-3975(95)00136-0_BIB16","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0304-3975(90)90110-4","article-title":"Local model checking in the modal \u03bc-calculus","volume":"89","author":"Stirling","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00136-0_BIB17","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0890-5401(89)90031-X","article-title":"An automata theoretic procedure for the propositional \u03bc-calculus","volume":"81","author":"Streett","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(95)00136-0_BIB18","first-page":"995","article-title":"Automata on infinite objects","volume":"Vol. B","author":"Thomas","year":"1990"},{"key":"10.1016\/0304-3975(95)00136-0_BIB19","doi-asserted-by":"crossref","DOI":"10.7146\/brics.v2i6.19508","article-title":"A complete deductive system for the \u03bc-Calculus","author":"Walukiewicz","year":"1993"},{"key":"10.1016\/0304-3975(95)00136-0_BIB20","series-title":"Proc. LICS'93","first-page":"136","article-title":"On completeness of the \u03bc-calculcus","author":"Walukiewicz","year":"1993"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001360?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001360?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T08:54:18Z","timestamp":1555404858000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595001360"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["0304397595001360"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00136-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}