{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:48Z","timestamp":1760202648194},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540587156"},{"type":"electronic","value":"9783540490548"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58715-2_121","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:41:26Z","timestamp":1330274486000},"page":"149-158","source":"Crossref","is-referenced-by-count":3,"title":["Finite-state strategies in regular infinite games"],"prefix":"10.1007","author":[{"given":"Wolfgang","family":"Thomas","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science 372 (1989)","first-page":"1","volume-title":"Automata, Languages, and Programming","author":"M. Abadi","year":"1989","unstructured":"M. Abadi, L. Lamport, P. Wolper, Realizable and unrealizable specifications of reactive systems, in: Automata, Languages, and Programming (G. Ausiello et al., eds.), Lecture Notes in Computer Science 372 (1989), Springer-Verlag, Berlin 1989, pp. 1\u201317."},{"key":"13_CR2","unstructured":"A. Church, Logic, arithmetic and automata, Proc. Intern. Congr. Math. 1960, Almqvist and Wiksells, Uppsala 1963."},{"key":"13_CR3","first-page":"1","volume-title":"Proc. Int. Congr. Logic, Method, and Philos, of Science","author":"J.R. B\u00fcchi","year":"1962","unstructured":"J.R. B\u00fcchi, On a decision method in restricted second order arithmetic, in: Proc. Int. Congr. Logic, Method, and Philos, of Science (E. Nagel et al., eds.), Stanford Univ. Press, Stanford 1962, pp. 1\u201311."},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science 56","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/3-540-08442-8_104","volume-title":"Fundamentals of Computation Theory","author":"J.R. B\u00fcchi","year":"1977","unstructured":"J.R. B\u00fcchi, Using determinacy to eliminate quantifiers, in: Fundamentals of Computation Theory (M. Karpinski, ed.), Lecture Notes in Computer Science 56, Springer-Verlag, Berlin 1977, pp. 367\u2013378."},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.2307\/2273681","volume":"48","author":"J.R. B\u00fcchi","year":"1983","unstructured":"J.R. B\u00fcchi, State-strategies for games in F \u03c3\u03b4 \u2229 G \u03b4\u03c3 , J. Symb. Logic 48 (1983), 1171\u20131198.","journal-title":"J. Symb. Logic"},{"key":"13_CR6","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1090\/S0002-9947-1969-0280205-0","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 (1969), 295\u2013311.","journal-title":"Trans. Amer. Math. Soc."},{"key":"13_CR7","volume-title":"Contributions to the Theory of Games","author":"D. Gale","year":"1953","unstructured":"D. Gale, F.M. Stewart, Infinite games with perfect information, in: Contributions to the Theory of Games, Princeton Univ. Press, Princeton, NJ, 1953."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Y. Gurevich, L. Harrington, Trees, automata, and games, in: Proc. 14th ACM Symp. on the Theory of Computing, San Francisco, 1982, pp. 60\u201365.","DOI":"10.1145\/800070.802177"},{"key":"13_CR9","first-page":"477","volume-title":"NATO ASI Series, Vol F13","author":"D. Harel","year":"1985","unstructured":"D. Harel, A. Pnueli, On the development of reactive systems, in: NATO ASI Series, Vol F13, Springer-Verlag, New York 1985, pp. 477\u2013498."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"R. Hossley, C.W. Rackoff, The emptiness problem for automata on infinite trees, in: Proc. 13th IEEE Symp. on Switching and Automata Theory, 1972, 121\u2013124.","DOI":"10.1109\/SWAT.1972.28"},{"key":"13_CR11","volume-title":"Diploma Thesis","author":"O. Junge","year":"1994","unstructured":"O. Junge, Konstruktion und Klassifizierung von Strategien f\u00fcr unendliche Spiele auf endlichen Graphen, Diploma Thesis, Inst. f. Informatik u. Prakt. Math., Kiel 1994."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"N. Klarlund, Progress measures, immediate determinacy, and a subset construction for tree automata, in: Proc. 7th IEEE Symp. on Logic in Computer Science, 1992.","DOI":"10.1109\/LICS.1992.185550"},{"key":"13_CR13","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/BF01691063","volume":"3","author":"L.H. Landweber","year":"1969","unstructured":"L.H. Landweber, Decision problems for \u03c9-automata, Math. Systems Theory 3 (1969), 376\u2013384.","journal-title":"Math. Systems Theory"},{"key":"13_CR14","doi-asserted-by":"crossref","first-page":"363","DOI":"10.2307\/1971035","volume":"102","author":"D. Martin","year":"1975","unstructured":"D. Martin, Borel determinacy, Ann. Math. 102 (1975), 363\u2013371.","journal-title":"Ann. Math."},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"R. McNaughton, Infinite games played on finite graphs, Ann. Pure Appl. Logic 65, 149\u2013184.","DOI":"10.1016\/0168-0072(93)90036-D"},{"key":"13_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0931-7","volume-title":"The Temporal Logic of Reactive and Concurrent Programs","author":"Z. Manna","year":"1992","unstructured":"Z. Manna, A. Pnueli, The Temporal Logic of Reactive and Concurrent Programs, Springer-Verlag, Berlin, Heidelberg, New York 1992."},{"key":"13_CR17","volume-title":"Logic from Computer Science","author":"A. Nerode","year":"1992","unstructured":"A. Nerode, A. Yaklinis, V. Yakhnis, Concurrent programs as strategies in games, in: Logic from Computer Science (Y. Moschovakis, ed.), Springer-Verlag, New York 1992."},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"A. Nerode, A. Yakhnis, V. Yakhnis, Modelling hybrid systems as games, in: Proc. 31st IEEE Conf. on Decision and Control, Tucson, Arizona, pp. 2947\u20132952.","DOI":"10.1109\/CDC.1992.371272"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"A. Pnueli, R. Rosner, On the synthesis of a reactive module, in: Proc. 16th ACM Symp. on Principles of Progr. Lang., Austin, pp. 179\u2013190.","DOI":"10.1145\/75277.75293"},{"key":"13_CR20","doi-asserted-by":"crossref","DOI":"10.1090\/cbms\/013","volume-title":"Automata on infinite objects and Church's Problem","author":"M.O. Rabin","year":"1972","unstructured":"M.O. Rabin, Automata on infinite objects and Church's Problem, Amer. Math. Soc., Providence, R.I., 1972."},{"key":"13_CR21","unstructured":"S. Seibert, Doctoral Thesis, in preparation."},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science 626","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BFb0023782","volume-title":"Computer Science Logic","author":"J.G. Thistle","year":"1992","unstructured":"J.G. Thistle, W.M. Wonham, Control of \u03c9-automata, Church's Problem, and the emptiness problem for tree \u03c9-automata, in: Computer Science Logic (E. B\u00f6rger et al. eds.), Lecture Notes in Computer Science 626, Springer-Verlag, Berlin 1992, pp. 367\u2013381."},{"key":"13_CR23","first-page":"133","volume-title":"Handbook of Theoretical Computer Science, Vol. B","author":"W. Thomas","year":"1990","unstructured":"W. Thomas, Automata on infinite objects, in: J. v. Leeuwen (ed.), Handbook of Theoretical Computer Science, Vol. B., Elsevier Science Publ., Amsterdam 1990, pp. 133\u2013191."},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science 803","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/3-540-58043-3_29","volume-title":"A Decade of Concurrency","author":"W. Thomas","year":"1994","unstructured":"W. Thomas, H. Lescow, Logical specifications of infinite computations, in: A Decade of Concurrency (J.W. de Bakker et al., eds.), Lecture Notes in Computer Science 803, Springer-Verlag, Berlin 1994, pp. 583\u2013621."},{"key":"13_CR25","volume-title":"Finite Automata","author":"B.A. Trakhtenbrot","year":"1973","unstructured":"B.A. Trakhtenbrot, Y.M. Barzdin, Finite Automata, North-Holland, Amsterdam 1973."},{"key":"13_CR26","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0168-0072(90)90024-V","volume":"48","author":"A. Yakhnis","year":"1990","unstructured":"A. Yakhnis, V. Yakhnis, Extension of Gurevich-Harrington's restricted memory determinacy theorem: A criterion for the winning player and an explicit class of winning stategies, Ann. Pure Appl. Logic 48 (1990), 277\u2013297.","journal-title":"Ann. Pure Appl. Logic"},{"key":"13_CR27","unstructured":"A. Yakhnis, V. Yakhnis, Gurevich-Harrington games defined by finite automata, Rep. 92-25, Math. Sciences Inst., Cornell Univ., Ithaca, N.Y."},{"key":"13_CR28","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1093\/logcom\/4.3.273","volume":"4","author":"S. Zeitman","year":"1994","unstructured":"S. Zeitman, Unforgettable forgetful determinacy, J. Logic Computation 4 (1994), 273\u2013283.","journal-title":"J. Logic Computation"}],"container-title":["Lecture Notes in Computer Science","Foundation of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58715-2_121.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:23:42Z","timestamp":1605648222000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58715-2_121"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540587156","9783540490548"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-58715-2_121","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}