{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:24:11Z","timestamp":1725891851312},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540472377"},{"type":"electronic","value":"9783540472384"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11901914_18","type":"book-chapter","created":{"date-parts":[[2006,10,10]],"date-time":"2006-10-10T05:21:43Z","timestamp":1160457703000},"page":"215-228","source":"Crossref","is-referenced-by-count":3,"title":["Controller Synthesis and Ordinal Automata"],"prefix":"10.1007","author":[{"given":"Thierry","family":"Cachat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","first-page":"142","volume-title":"CONCUR 2003 - Concurrency Theory","author":"L. Alfaro de","year":"2003","unstructured":"de Alfaro, L., Fa\u00eblla, M., Henzinger, T.A., Majumdar, R., Stoelinga, M.: The element of surprise in timed games. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 142\u2013156. Springer, Heidelberg (2003)"},{"issue":"3","key":"18_CR2","first-page":"389","volume":"57","author":"E. Asarin","year":"1998","unstructured":"Asarin, E., Maler, O.: Achilles and the tortoise climbing up the arithmetical hierarchy. JCSS\u00a057(3), 389\u2013398 (1998)","journal-title":"JCSS"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/11505877_14","volume-title":"Developments in Language Theory","author":"A. B\u00e8s","year":"2005","unstructured":"B\u00e8s, A., Carton, O.: A Kleene theorem for languages of words indexed by linear orderings. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol.\u00a03572, pp. 158\u2013167. Springer, Heidelberg (2005)"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-45069-6_18","volume-title":"Computer Aided Verification","author":"P. Bouyer","year":"2003","unstructured":"Bouyer, P., D\u2019Souza, D., Madhusudan, P., Petit, A.: Timed control with partial observability. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 180\u2013192. Springer, Heidelberg (2003)"},{"key":"18_CR5","unstructured":"Bedon, N.: Langages reconnaissables de mots index\u00e9s par des ordinaux. PhD thesis, Universit\u00e9 de Marne-la-Vall\u00e9e (1998)"},{"issue":"1","key":"18_CR6","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0304-3975(98)00096-6","volume":"210","author":"O. Bournez","year":"1999","unstructured":"Bournez, O.: Achilles and the tortoise climbing up the hyper-arithmetical hierarchy. TCS\u00a0210(1), 21\u201371 (1999)","journal-title":"TCS"},{"issue":"1","key":"18_CR7","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s002360050003","volume":"37","author":"B. B\u00e9rard","year":"2000","unstructured":"B\u00e9rard, B., Picaronny, C.: Accepting Zeno words: A way toward timed refinements. Acta Informatica\u00a037(1), 45\u201381 (2000)","journal-title":"Acta Informatica"},{"key":"18_CR8","series-title":"Lect. Notes in Math.","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0082720","volume-title":"The monadic second order theory of all countable ordinals","author":"J.R. Buchi","year":"1973","unstructured":"Buchi, J.R., Siefkes, D.: The monadic second order theory of all countable ordinals. Lect. Notes in Math., vol.\u00a0328. Springer, Heidelberg (1973)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-45687-2_12","volume-title":"Mathematical Foundations of Computer Science 2002","author":"O. Carton","year":"2002","unstructured":"Carton, O.: Accessibility in automata on scattered linear orderings. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol.\u00a02420, pp. 155\u2013164. Springer, Heidelberg (2002)"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-540-31834-7_14","volume-title":"Machines, Computations, and Universality","author":"J. Durand-Lose","year":"2005","unstructured":"Durand-Lose, J.: Abstract geometrical computation for black hole computation (extended abstract). In: Margenstern, M. (ed.) MCU 2004. LNCS, vol.\u00a03354, pp. 176\u2013187. Springer, Heidelberg (2005)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/11562948_20","volume-title":"Automated Technology for Verification and Analysis","author":"S. Demri","year":"2005","unstructured":"Demri, S., Nowak, D.: Reasoning about transfinite sequences (extended abstract). In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol.\u00a03707, pp. 248\u2013262. Springer, Heidelberg (2005)"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Logics, and Infinite Games","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol.\u00a02500. Springer, Heidelberg (2002)"},{"issue":"2","key":"18_CR13","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1006\/inco.1994.1035","volume":"110","author":"P. Godefroid","year":"1994","unstructured":"Godefroid, P., Wolper, P.: A partial approach to model checking. Inform. and Comput.\u00a0110(2), 305\u2013326 (1994)","journal-title":"Inform. and Comput."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Jurdzinski, M., Paterson, M., Zwick, U.: A deterministic subexponential algorithm for solving parity games. In: SODA, pp. 117\u2013123 (2006)","DOI":"10.1145\/1109557.1109571"},{"key":"18_CR15","unstructured":"Kamp, H.: Tense Logic and the Theory of Linear Order. PhD thesis, University of California at Los Angeles (1968)"},{"key":"18_CR16","unstructured":"L\u00f6ding, C.: Methods for the transformation of omega-automata: Complexity and connection to second order logic. Master\u2019s thesis, Christian-Albrechts-University of Kiel (1998)"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"363","DOI":"10.2307\/1971035","volume":"102","author":"D.A. Martin","year":"1975","unstructured":"Martin, D.A.: Borel Determinacy. Annals of Math.\u00a0102, 363\u2013371 (1975)","journal-title":"Annals of Math."},{"issue":"2","key":"18_CR18","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0304-3975(95)00221-9","volume":"165","author":"F. Maurin","year":"1996","unstructured":"Maurin, F.: Exact complexity bounds for ordinal addition. Theor. Comput. Sci.\u00a0165(2), 247\u2013273 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1145\/75277.75293","volume-title":"POPL 1989","author":"A. Pnueli","year":"1989","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: POPL 1989, pp. 179\u2013190. ACM Press, New York (1989)"},{"issue":"2","key":"18_CR20","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0022-0000(84)90034-5","volume":"29","author":"J.H. Reif","year":"1984","unstructured":"Reif, J.H.: The complexity of two-player games of incomplete information. J. Comput. System Sci.\u00a029(2), 274\u2013301 (1984)","journal-title":"J. Comput. System Sci."},{"key":"18_CR21","volume-title":"Linear orderings","author":"J.G. Rosenstein","year":"1982","unstructured":"Rosenstein, J.G.: Linear orderings. Academic Press, London (1982)"},{"issue":"1","key":"18_CR22","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/5.21072","volume":"77","author":"P.J. Ramadge","year":"1989","unstructured":"Ramadge, P.J., Wonham, W.M.: The control of discrete event systems. Proceedings of IEEE\u00a077(1), 81\u201398 (1989)","journal-title":"Proceedings of IEEE"},{"key":"18_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-60275-5","volume-title":"STACS 95","author":"W. Thomas","year":"1995","unstructured":"Thomas, W.: On the synthesis of strategies in infinite games. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol.\u00a0900, pp. 1\u201313. Springer, Heidelberg (1995)"},{"key":"18_CR24","unstructured":"Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: LICS 1986, pp. 332\u2013344 (1986)"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11901914_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:37:09Z","timestamp":1619509029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11901914_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540472377","9783540472384"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11901914_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}