{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T05:57:55Z","timestamp":1774331875236,"version":"3.50.1"},"reference-count":20,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,4,1]],"date-time":"1996-04-01T00:00:00Z","timestamp":828316800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1996,4,1]],"date-time":"1996-04-01T00:00:00Z","timestamp":828316800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1999,2,12]],"date-time":"1999-02-12T00:00:00Z","timestamp":918777600000},"content-version":"vor","delay-in-days":1047,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[1996,4]]},"DOI":"10.1016\/0168-0072(95)00032-1","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T17:18:06Z","timestamp":1051723086000},"page":"203-242","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":11,"title":["McNaughton games and extracting strategies for concurrent programs"],"prefix":"10.1016","volume":"78","author":[{"given":"Anil","family":"Nerode","sequence":"first","affiliation":[]},{"given":"Jeffrey B.","family":"Remmel","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Yakhnis","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0168-0072(95)00032-1_BIB1","series-title":"Proc. Internat. Congr. Logic, Method., and Phil. Sci. of 1960","first-page":"1","article-title":"On a decision method in restricted second-order arithmetic","author":"B\u00fcchi","year":"1962"},{"key":"10.1016\/0168-0072(95)00032-1_BIB2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1090\/S0002-9947-1969-0280205-0","article-title":"Solving sequential conditions by finite state strategies","volume":"138","author":"B\u00fcchi","year":"1969","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0168-0072(95)00032-1_BIB3","series-title":"Hybrid Systems","year":"1993"},{"key":"10.1016\/0168-0072(95)00032-1_BIB4","series-title":"Monadic second-order Theories, Model-theoretic Logics","author":"Gurevich","year":"1985"},{"key":"10.1016\/0168-0072(95)00032-1_BIB5","series-title":"14th Symp. on Theory of Computation","first-page":"60","article-title":"Trees, automata and games","author":"Gurevich","year":"1982"},{"key":"10.1016\/0168-0072(95)00032-1_BIB6","series-title":"Hybrid Systems","article-title":"Models for hybrid systems: automata, toplogies, controllability and observability","author":"Kohn","year":"1993"},{"key":"10.1016\/0168-0072(95)00032-1_BIB7","series-title":"The Collected Works of J. Richard B\u00fcchi","year":"1990"},{"key":"10.1016\/0168-0072(95)00032-1_BIB8","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0168-0072(93)90036-D","article-title":"Infinite games played on finite graphs","volume":"65","author":"McNaughton","year":"1993","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0168-0072(95)00032-1_BIB9","article-title":"Hybrid system games: extraction of control automata and small topologies","author":"Nerode","year":"1993"},{"key":"10.1016\/0168-0072(95)00032-1_BIB10","series-title":"9th IEEE Conf. on Intelligent Control","article-title":"Hybrid systems and continuous Sensing Games","author":"Nerode","year":"1993"},{"key":"10.1016\/0168-0072(95)00032-1_BIB11","first-page":"2947","article-title":"Modelling hybrid sysytems as games","author":"Nerode","year":"1992","journal-title":"CDC92"},{"key":"10.1016\/0168-0072(95)00032-1_BIB12","article-title":"Hybrid games and hybrid systems","author":"Nerode","year":"1993"},{"key":"10.1016\/0168-0072(95)00032-1_BIB13","series-title":"Concurrent Programs as Strategies in Games","author":"Nerode","year":"1992"},{"key":"10.1016\/0168-0072(95)00032-1_BIB14","first-page":"133","article-title":"Automata on infinite objects","volume":"Vol. B","author":"Thomas","year":"1990"},{"key":"10.1016\/0168-0072(95)00032-1_BIB15","series-title":"7th Army Conference on Applied Math and Computing","article-title":"Concurrent Specifications and their Gurevich-Harrington Games and Representation of Programs as Strategies","author":"Yakhnis","year":"1989"},{"key":"10.1016\/0168-0072(95)00032-1_BIB16","series-title":"7th Army Conf. on Applied Math and Computing","article-title":"Extraction of concurrent programs from Gurevich-Harrington games","author":"Yakhnis","year":"1989"},{"key":"10.1016\/0168-0072(95)00032-1_BIB17","article-title":"Game-Theoretic Semantics for Concurrent Programs and their Specifications","author":"Yakhnis","year":"1990"},{"key":"10.1016\/0168-0072(95)00032-1_BIB18","article-title":"Concurrent Programs, Calculus of State Strategies, and Gurevich Harrington Games","author":"Yakhnis","year":"1990"},{"key":"10.1016\/0168-0072(95)00032-1_BIB19","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0168-0072(90)90024-V","article-title":"Extension of Gurevich-Harrington's restricted Memory determinacy theorem: a criterion of the winning player and an explicit class of winning strategies","volume":"48","author":"Yakhnis","year":"1990","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0168-0072(95)00032-1_BIB20","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0168-0072(93)90239-A","article-title":"Gurevich-Harrington's games defined by finite automata","volume":"62","author":"Yakhnis","year":"1993","journal-title":"Ann. Pure Appl. Logic"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0168007295000321?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0168007295000321?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:39:14Z","timestamp":1757453954000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0168007295000321"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4]]},"references-count":20,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["0168007295000321"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(95)00032-1","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1996,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"McNaughton games and extracting strategies for concurrent programs","name":"articletitle","label":"Article Title"},{"value":"Annals of Pure and Applied Logic","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0168-0072(95)00032-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1996 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}