{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:04Z","timestamp":1725664684100},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540613770"},{"type":"electronic","value":"9783540685074"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61377-3_49","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:35:42Z","timestamp":1330292142000},"page":"368-387","source":"Crossref","is-referenced-by-count":0,"title":["Effective strategies for enumeration games"],"prefix":"10.1007","author":[{"given":"Martin","family":"Kummer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Ott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Martin Abadi, Leslie Lamport, Pierre Wolper. Realizable and unrealizable specifications of reactive systems. In Proc. of 16th Int'l Colloquium on Automata, Languages and Programming, Lect. Notes in Comput. Sci., Vol. 372, pages 1\u201317. Springer-Verlag, 1989.","DOI":"10.1007\/BFb0035748"},{"key":"22_CR2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1090\/S0002-9947-1969-0280205-0","volume":"138","author":"J. Richard B\u00fcchi","year":"1969","unstructured":"J. Richard B\u00fcchi, Lawrence H. Landweber. Solving sequential conditions by finite-state strategies. Trans. Amer. Math. Soc., 138:295\u2013311, 1969.","journal-title":"Trans. Amer. Math. Soc."},{"key":"22_CR3","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0012-365X(72)90086-6","volume":"3","author":"A. Blass","year":"1972","unstructured":"Andreas Blass. Complexity of winning strategies. Discrete Mathematics, 3:295\u2013300, 1972.","journal-title":"Discrete Mathematics"},{"key":"22_CR4","unstructured":"Alonzo Church. Logic, arithmetic and automata. In Proceedings of the International Congress of Mathematicians, August 1962, pages 23\u201335, Stockholm, 1963."},{"key":"22_CR5","first-page":"93","volume":"38","author":"Y. Gurevich","year":"1989","unstructured":"Yuri Gurevich. The logic in computer science column: Infinite games. Bulletin of the European Association for Theoretical Computer Science, 38:93\u2013100, 1989.","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Martin Kummer, Frank Stephan. Inclusion problems in parallel learning and games. Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, COLT 94, pages 287\u2013298, ACM Press, 1994.","DOI":"10.1145\/180139.181156"},{"issue":"2","key":"22_CR7","doi-asserted-by":"crossref","first-page":"291","DOI":"10.2307\/1970579","volume":"91","author":"A. H. Lachlan","year":"1970","unstructured":"Alistair H. Lachlan. On some games which are relevant to the theory of recursively enumerable sets. Ann. of Math., 91(2):291\u2013310, 1970.","journal-title":"Ann. of Math."},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Helmut Lescow. On Polynomial-Size Programs Winning Finite-State Games. CAV: International Conference on Computer Aided Verification, Lect. Notes in Comput. Sci., Vol. 939, pages 239\u2013252. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60045-0_54"},{"key":"22_CR9","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0168-0072(93)90036-D","volume":"65","author":"R. McNaughton","year":"1993","unstructured":"Robert 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":"22_CR10","doi-asserted-by":"crossref","unstructured":"Yiannis N. Moschovakis. A game-theoretic modeling of concurrency. In Proceedings, Fourth Annual Symposium on Logic in Computer Science, pages 154\u2013163. IEEE Computer Society Press, 1989.","DOI":"10.1109\/LICS.1989.39170"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Oded Maler, Amir Pnueli, Joseph Sifakis. On the synthesis of discrete controllers for timed systems. In STACS 95, Lect. Notes in Comput. Sci., Vol. 900, pages 229\u2013242. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-59042-0_76"},{"key":"22_CR12","unstructured":"Anil Nerode, Alexander Yakhnis. Modelling hybrid systems as games. Technical Report 92-36, Mathematical Sciences Institute, Cornell University, October 1992."},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Anil Nerode, Alexander Yakhnis, Vladimir Yakhnis. Concurrent programs as strategies in games. In Logic from Computer Science: Proceedings of a Workshop held November 13\u201317, 1989. Springer-Verlag, 1992.","DOI":"10.1007\/978-1-4612-2822-6_17"},{"key":"22_CR14","volume-title":"Classical recursion theory","author":"P. Odifreddi","year":"1989","unstructured":"Piergiorgio Odifreddi. Classical recursion theory. North-Holland, Amsterdam, 1989."},{"key":"22_CR15","unstructured":"Matthias Ott. Strategien in Aufz\u00e4hlungsspielen. Diplomarbeit, Institut f\u00fcr Logik, Komplexit\u00e4t und Deduktionssysteme, Universit\u00e4t Karlsruhe, February 1995."},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Amir Pnueli, Roni Rosner. On the synthesis of a reactive module. In Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, pages 179\u2013190, Austin, Texas, 1989.","DOI":"10.1145\/75277.75293"},{"key":"22_CR17","volume-title":"Theory of recursive functions and effective computability","author":"H. Rogers","year":"1967","unstructured":"Hartley Rogers. Theory of recursive functions and effective computability. McGraw-Hill, New York, 1967."},{"key":"22_CR18","volume-title":"Perspectives in Mathematical Logic","author":"R. I. Soare","year":"1987","unstructured":"Robert I. Soare. Recursively enumerable sets and degrees. Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 1987."},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Wolfgang Thomas. Automata on infinite objects. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 133\u2013191. Elsevier Science Publishers B. V., 1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Wolfgang Thomas. On the synthesis of strategies in infinite games. In STACS 95, Lect. Notes in Comput. Sci., Vol. 900, pages 1\u201313. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-59042-0_57"},{"issue":"4","key":"22_CR21","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1137\/S0363012991217524","volume":"32","author":"J. G. Thistle","year":"1994","unstructured":"J. G. Thistle, W. M. Wonham. Supervision of infinite behaviour of discrete-event systems. SIAM Journal on Control and Optimization, 32(4):1098\u20131113, 1994.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Howard Wong-Toi, David L. Dill. Synthesizing processes and schedulers from temporal specifications. In Computer-Aided Verification '90, pages 177\u2013186. American Mathematical Society, 1991.","DOI":"10.1090\/dimacs\/003\/13"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61377-3_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:05:53Z","timestamp":1605647153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61377-3_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613770","9783540685074"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-61377-3_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}