{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:03:43Z","timestamp":1725480223615},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405054"},{"type":"electronic","value":"9783540450665"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45066-1_16","type":"book-chapter","created":{"date-parts":[[2007,2,28]],"date-time":"2007-02-28T07:41:13Z","timestamp":1172648473000},"page":"203-214","source":"Crossref","is-referenced-by-count":1,"title":["Finite State Strategies in One Player McNaughton Games"],"prefix":"10.1007","author":[{"given":"Bakhadyr","family":"Khoussainov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.2307\/1994916","volume":"138","author":"J.R. B\u00fcchi","year":"1969","unstructured":"J.R. B\u00fcchi, L.H. Landweber. Solving Sequential Conditions by Finite State Strategies. Trans. Amer. Math. Soc. 138, p.295\u2013311, 1969.","journal-title":"Trans. Amer. Math. Soc."},{"key":"16_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1007\/3-540-45678-3_47","volume-title":"Algorithms and Computation","author":"H.L. Bodlaender","year":"2001","unstructured":"H.L. Bodlaender, M.J. Dinneen, and B. Khoussainov. On Game-Theoretic Models of Networks, in Algorithms and Computation (ISAAC 2001 proceedings), LNCS 2223, P. Eades and T. Takaoka (Eds.), p. 550\u2013561, Springer-Verlag Berlin Heidelberg 2001."},{"key":"16_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/3-540-40064-8_13","volume-title":"Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science, WG2000","author":"M.J. Dinneen","year":"2000","unstructured":"M.J. Dinneen and B. Khoussainov. Update networks and their routing strategies. In Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science, WG2000, volume 1928 of Lecture Notes on Computer Science, pages 127\u2013136. Springer-Verlag, June 2000."},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"S. Dziembowski, M. Jurdzinski, and I. Walukiewicz. How much memory is needed to win infinite games? In Proceedings, Twelth Annual IEEE Symposium on Logic in Computer Science, p. 99\u2013110, Warsaw, Poland, 1997.","DOI":"10.1109\/LICS.1997.614939"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Y. Gurevich and L. Harrington. Trees, Automata, and Games, STOCS, 1982, pages 60\u201365.","DOI":"10.1145\/800070.802177"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"H. Ishihara, B. Khoussainov. Complexity of Some Infinite Games Played on Finite Graphs, to appear in Proceedings of the 28th International Workshop on Graph-Theoretic Methods in Computer Science, WG 2002, Checz Republic.","DOI":"10.1007\/3-540-36379-3_24"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"363","DOI":"10.2307\/1971035","volume":"102","author":"D. Martin","year":"1975","unstructured":"D. Martin. Borel Determinacy. Ann. Math. Vol 102, 363\u2013375, 1975.","journal-title":"Ann. Math"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0168-0072(93)90036-D","volume":"65","author":"R. McNaughton","year":"1993","unstructured":"R. McNaughton. Infinite games played on finite graphs. Annals of Pure and Applied Logic, 65:149\u2013184, 1993.","journal-title":"Annals of Pure and Applied Logic"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0168-0072(95)00032-1","volume":"78","author":"A. Nerode","year":"1996","unstructured":"A. Nerode, J. Remmel, and A. Yakhnis. McNaughton games and extracting strategies for concurrent programs. Annals of Pure and Applied Logic, 78:203\u2013242, 1996.","journal-title":"Annals of Pure and Applied Logic"},{"key":"16_CR10","first-page":"624","volume-title":"Progr. Comput. Sci. Appl. Logic","author":"A. Nerode","year":"1993","unstructured":"A. Nerode, A. Yakhnis, and V. Yakhnis. Distributed concurrent programs as strategies in games. Logical methods (Ithaca, NY, 1992), p. 624\u2013653, Progr. Comput. Sci. Appl. Logic, 12, Birkhauser Boston, Boston, MA, 1993."},{"issue":"2","key":"16_CR11","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"R.E. Tarjan. Depth first search and linear graph algorithms. SIAM J. Computing 1:2, p. 146\u2013160, 1972.","journal-title":"SIAM J. Computing"},{"key":"16_CR12","unstructured":"M. Vardi. An automata-theoretic approach to linear temporal logic. Proceedings of the VIII Banff Higher Order Workshop. Springer Workshops in Computing Series, Banff, 1994."}],"container-title":["Lecture Notes in Computer Science","Discrete Mathematics and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45066-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T20:18:45Z","timestamp":1556137125000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45066-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405054","9783540450665"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45066-1_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}