{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:12:31Z","timestamp":1762521151459},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439974"},{"type":"electronic","value":"9783540456575"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45657-0_5","type":"book-chapter","created":{"date-parts":[[2007,5,19]],"date-time":"2007-05-19T14:59:43Z","timestamp":1179586783000},"page":"58-65","source":"Crossref","is-referenced-by-count":50,"title":["Infinite Games and Verification"],"prefix":"10.1007","author":[{"given":"Wolfgang","family":"Thomas","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,20]]},"reference":[{"key":"5_CR1","first-page":"469","volume-title":"Proc. IFAC Symposium on System Structure and Control","author":"E. Asarin","year":"1998","unstructured":"E. Asarin, O. Maler, A. Pnueli, J. Sifakis, Controller Synthesis for Timed Automata, Proc. IFAC Symposium on System Structure and Control, 469\u2013474, Elsevier, Amsterdam 1998."},{"key":"5_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-48983-5_6","volume-title":"Computation and Control","author":"E. Asarin","year":"1999","unstructured":"E. Asarin, O. Maler, As Soon as Possible: Time Optimal Control for Timed Automata, Hybrid Systems (F. Vaandrager et al. Eds.): Computation and Control, Lecture Notes in Computer Science 1569 (1999), 19\u201330."},{"key":"5_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/3-540-56922-7_32","volume-title":"CAV\u201993","author":"E. A. Emerson","year":"1993","unstructured":"E. A. Emerson, C. S. Jutla, A. P. Sistla, On model checking for fragments of \u03bc-calculus, in: CAV\u201993 (C. Coucoubetis, Ed), Lecture Notes in Computer Science 697 (1993), 385\u2013396."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"S. Dziembowski, M. Jurdzinski, I. Walukiewicz, How much memory is needed to win infinite games?, Proc. 12th IEEE Symp. on Logic in Computer Science, 1997, 99\u2013110.","DOI":"10.1109\/LICS.1997.614939"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0020-0190(98)00150-1","volume":"68","author":"M. Jurdzinski","year":"1998","unstructured":"M. Jurdzinski, Deciding the winner in parity games is in UP\u2229co-UP, Inform. Processing Letters\n                           68 (1998), 119\u2013124.","journal-title":"Inform. Processing Letters"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"245","DOI":"10.2307\/421091","volume":"5","author":"O. Kupferman","year":"1999","unstructured":"O. Kupferman, M. Y. Vardi, Church\u2019s problem revisited, Bull. Symb. Logic 5 (1999), 245\u2013263.","journal-title":"Bull. Symb. Logic"},{"key":"5_CR7","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":"5_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/3-540-48224-5_33","volume-title":"Proc. ICALP 2001","author":"P. Madhusudan","year":"2001","unstructured":"P. Madhusudan, P. S. Thiagarajan: Distributed Controller Synthesis for Local Specifications. Proc. ICALP 2001, Lecture Notes in Computer Science 2076 (2001), 396\u2013407."},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"A. Pnueli, R. Rosner, Distributed reactive systems are hard to synthesize, Proc. 31st IEEE Symp. on Foundation of Computer Science, 1990, 746\u2013757.","DOI":"10.1109\/FSCS.1990.89597"},{"key":"5_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3550-5","volume-title":"Modal and Temporal Properties of Processes","author":"C. Stirling","year":"2001","unstructured":"C. Stirling, Modal and Temporal Properties of Processes, Springer-Verlag, New York 2001."},{"key":"5_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-60275-5","volume-title":"STACS\u201995","author":"W. Thomas","year":"1995","unstructured":"W. Thomas, On the synthesis of strategies in infinite games, in: STACS\u201995 (E. W. Mayr, C. Puech, Eds.), Lecture Notes in Computer Science 900 (1995), 1\u201313."},{"key":"5_CR12","volume-title":"Handbook of Formal Languages","author":"W. Thomas","year":"1997","unstructured":"W. Thomas, Languages, automata, and logic, in: Handbook of Formal Languages (G. Rozenberg, A. Salomaa, Eds.), Vol. 3, Springer-Verlag, Berlin Heidelberg 1997."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"J. V\u00f6ge, M. Jurdzinski, A strategy improvement algorithm for solving parity games, CAV 2000, Lect. Notes in Computer Science 1855 (2000), 202\u2013215.","DOI":"10.1007\/10722167_18"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1999.2836","volume":"157","author":"I. Walukiewicz","year":"2000","unstructured":"I. Walukiewicz, Pushdown processes: games and model-checking, Information and Computation\n                           157 (2000), 234\u2013263.","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45657-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T20:22:24Z","timestamp":1550348544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45657-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439974","9783540456575"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45657-0_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}