{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T07:50:12Z","timestamp":1780559412987,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540590422","type":"print"},{"value":"9783540491750","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59042-0_57","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:58:26Z","timestamp":1330275506000},"page":"1-13","source":"Crossref","is-referenced-by-count":145,"title":["On the synthesis of strategies in infinite games"],"prefix":"10.1007","author":[{"given":"Wolfgang","family":"Thomas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science 372 (1989)","first-page":"1","volume-title":"Proc. 17th ICALP","author":"M. Abadi","year":"1989","unstructured":"M. Abadi, L. Lamport, P. Wolper, Realizable and unrealizable specifications of reactive systems, in: Proc. 17th ICALP (G. Ausiello et al., eds.), Lecture Notes in Computer Science 372 (1989), Springer-Verlag, Berlin 1989, pp. 1\u201317."},{"key":"1_CR2","first-page":"1","volume-title":"On a decision method in restricted second order arithmetic","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":"1_CR3","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":"1_CR4","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\n\n                  \u03c3\u03b4\n                \u2229G\n\n                  \u03b4\u03c3\n                , J. Symb. Logic 48 (1983), 1171\u20131198.","journal-title":"J. Symb. Logic"},{"key":"1_CR5","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.\n138 (1969), 295\u2013311.","journal-title":"Trans. Amer. Math. Soc."},{"key":"1_CR6","first-page":"451","volume-title":"Technology and Applications, Information Processing '94, Vol. I","author":"O. Carton","year":"1994","unstructured":"O. Carton, Chain automata, in: Technology and Applications, Information Processing '94, Vol. I (B. Pherson, I. Simon, eds.), IFIP, North-Holland, Amsterdam 1994, pp. 451\u2013458."},{"key":"1_CR7","first-page":"21","volume-title":"Proc. Intern. Congr. Math. 1962","author":"A. Church","year":"1963","unstructured":"A. Church, Logic, arithmetic and automata, Proc. Intern. Congr. Math. 1962, Almqvist and Wiksells, Uppsala 1963, pp. 21\u201335."},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science 803","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/3-540-58043-3_19","volume-title":"A Decade of Concurrency","author":"E. Clarke","year":"1994","unstructured":"E. Clarke, O. Grumberg, D. Long, Verification tools for finite-state concurrent systems, in: A Decade of Concurrency (J.W. de Bakker et al., eds.), Lecture Notes in Computer Science 803, Springer-Verlag, Berlin 1994, pp. 124\u2013175."},{"key":"1_CR9","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","volume":"25","author":"B. Courcelle","year":"1983","unstructured":"B. Courcelle, Fundamental properties of infinite trees, Theor. Comput. Sci.\n25 (1983), 95\u2013169.","journal-title":"Theor. Comput. Sci."},{"key":"1_CR10","unstructured":"B. Courcelle, The monadic second-order theory of graphs IX: Machines and their behaviours, Techn. Report, LaBRI; Universit\u00e9 Bordeaux I, 1994."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"E.A. Emerson, C.S. Jutla, Tree automata, Mu-calculus and determinacy, in: Proc. 32th Symp. on Foundations of Computer Science (1991), 368\u2013377.","DOI":"10.1109\/SFCS.1991.185392"},{"key":"1_CR12","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":"1_CR13","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0168-0072(94)90086-8","volume":"69","author":"N. Klarlund","year":"1994","unstructured":"N. Klarlund, Progress measures, immediate determinacy, and a subset construction for tree automata, Ann. Pure Appl. Logic\n69 (1994), 243\u2013168.","journal-title":"Ann. Pure Appl. Logic"},{"key":"1_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.\n102 (1975), 363\u2013371.","journal-title":"Ann. Math."},{"key":"1_CR15","doi-asserted-by":"crossref","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, Ann. Pure Appl. Logic\n65 (1993), 149\u2013184.","journal-title":"Ann. Pure Appl. Logic"},{"key":"1_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, Berin, Heidelberg, New York 1992."},{"key":"1_CR17","volume-title":"Descriptive Set Theory","author":"Y. N. Moschovakis","year":"1980","unstructured":"Y. N. Moschovakis, Descriptive Set Theory, North-Holland, Amsterdam 1980."},{"key":"1_CR18","unstructured":"O. Maler, A. Pnueli, J. Sifakis, On the synthesis of discrete controllers for timed systems, these Proceedings."},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science 208","first-page":"157","volume-title":"Computation Theory","author":"A.W. Mostowski","year":"1984","unstructured":"A.W. Mostowski, Regular expressions for infinite trees and a standard form of automata, in: A. Skowron (ed.), Computation Theory, Lecture Notes in Computer Science 208, Springer-Verlag, Berlin 1984, pp. 157\u2013168."},{"key":"1_CR20","unstructured":"A.W. Mostowski, Games with forbidden positions, Preprint No. 78, Uniwersytet Gda\u0144ski, Instytyt Matematyki, 1991."},{"key":"1_CR21","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0304-3975(91)90283-8","volume":"83","author":"A.W. Mostowski","year":"1991","unstructured":"A.W. Mostowski, Hierarchies of weak automata and weak monadic formulas, Theor. Comput. Sci.\n83 (1991), 323\u2013335.","journal-title":"Theor. Comput. Sci."},{"key":"1_CR22","first-page":"220","volume":"48","author":"A. Muchnik","year":"1992","unstructured":"A. Muchnik, Games on infinite trees and automata with dead-ends. A new proof for the decidability of the monadic second-order theory of two successors, Bull. of the EATCS\n48 (1992), 220\u2013267.","journal-title":"Bull. of the EATCS"},{"key":"1_CR23","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0304-3975(85)90087-8","volume":"37","author":"D.E. Muller","year":"1985","unstructured":"D.E. Muller, P.E. Schupp, The theory of ends, pushdown automata, and second-order logic, Theor. Comput. Sci.\n37 (1985), 51\u201375.","journal-title":"Theor. Comput. Sci."},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"D.E. Muller, P.E. Schupp, Simulating alternating tree automata by nondeterministic automata: new results and new proofs of the theorems of Rabin, McNaughton and Safra, Theor. Comput. Sci. (to appear).","DOI":"10.1016\/0304-3975(94)00214-4"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"A. Nerode, A. Yakhnis, V. Yakhnis, Concurrent programs as strategies in games, in: Logic from Computer Science (Y. Moschovakis, ed.), Springer, 1992.","DOI":"10.1007\/978-1-4612-2822-6_17"},{"key":"1_CR26","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, pp. 2947\u20132952.","DOI":"10.1109\/CDC.1992.371272"},{"key":"1_CR27","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":"1_CR28","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, RI, 1972."},{"key":"1_CR29","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1109\/5.21072","volume":"77","author":"P.J.G. Ramadge","year":"1989","unstructured":"P.J.G. Ramadge, W.M. Wonham, The control of discrete event systems, Proc. of the IEEE\n77 (1989), 81\u201398.","journal-title":"Proc. of the IEEE"},{"key":"1_CR30","unstructured":"S. Seibert, Doctoral Thesis, in preparation."},{"key":"1_CR31","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":"1_CR32","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 strategies, Ann. Pure Appl. Logic\n48 (1990), 277\u2013297.","journal-title":"Ann. Pure Appl. Logic"},{"key":"1_CR33","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\n4 (1994), 273\u2013283.","journal-title":"J. Logic Computation"}],"container-title":["Lecture Notes in Computer Science","STACS 95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59042-0_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:22:10Z","timestamp":1619572930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59042-0_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540590422","9783540491750"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-59042-0_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}