{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T13:24:38Z","timestamp":1792070678620,"version":"4.4.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540454588","type":"print"},{"value":"9783540454595","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11874683_26","type":"book-chapter","created":{"date-parts":[[2006,9,27]],"date-time":"2006-09-27T13:47:26Z","timestamp":1159364846000},"page":"395-410","source":"Crossref","is-referenced-by-count":58,"title":["Solving Games Without Determinization"],"prefix":"10.1007","author":[{"given":"Thomas A.","family":"Henzinger","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nir","family":"Piterman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/11605157_22","volume-title":"Implementation and Application of Automata","author":"C.S. Althoff","year":"2006","unstructured":"Althoff, C.S., Thomas, W., Wallmeier, N.: Observations on determinization of b\u00fcchi automata. In: Farr\u00e9, J., Litovsky, I., Schmitz, S. (eds.) CIAA 2005. LNCS, vol.\u00a03845, pp. 262\u2013272. Springer, Heidelberg (2006)"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"295","DOI":"10.2307\/1994916","volume":"138","author":"J.R. B\u00fcchi","year":"1969","unstructured":"B\u00fcchi, J.R., Landweber, L.H.G.: Solving sequential conditions by finite-state strategies. Trans. AMS\u00a0138, 295\u2013311 (1969)","journal-title":"Trans. AMS"},{"key":"26_CR3","first-page":"368","volume-title":"FOCS","author":"E.A. Emerson","year":"1991","unstructured":"Emerson, E.A., Jutla, C.: Tree automata, \u03bc-calculus and determinacy. In: FOCS, pp. 368\u2013377. IEEE, Los Alamitos (1991)"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/3-540-56922-7_32","volume-title":"Computer Aided Verification","author":"E.A. Emerson","year":"1993","unstructured":"Emerson, E.A., Jutla, C., Sistla, A.P.: On model checking for fragments of \u03bc-calculus. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 385\u2013396. Springer, Heidelberg (1993)"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/3-540-63141-0_19","volume-title":"CONCUR\u201997: Concurrency Theory","author":"T.A. Henzinger","year":"1997","unstructured":"Henzinger, T.A., Kupferman, O., Rajamani, S.: Fair simulation. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol.\u00a01243, pp. 273\u2013287. Springer, Heidelberg (1997)"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-540-31980-1_31","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Harding","year":"2005","unstructured":"Harding, A., Ryan, M., Schobbens, P.Y.: A new algorithm for strategy synthesis in LTL games. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, pp. 477\u2013492. Springer, Heidelberg (2005)"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/11513988_23","volume-title":"Computer Aided Verification","author":"B. Jobstmann","year":"2005","unstructured":"Jobstmann, B., Griesmayer, A., Bloem, R.: Program repair as a game. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 226\u2013238. Springer, Heidelberg (2005)"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-46541-3_24","volume-title":"STACS 2000","author":"M. Jurdzinski","year":"2000","unstructured":"Jurdzinski, M.: Small progress measures for solving parity games. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 290\u2013301. Springer, Heidelberg (2000)"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/10722167_18","volume-title":"Computer Aided Verification","author":"M. Jurdzinski","year":"2000","unstructured":"Jurdzinski, M., Voge, J.: A discrete strategy improvement algorithm for solving parity games. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 202\u2013215. Springer, Heidelberg (2000)"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/11605157_17","volume-title":"Implementation and Application of Automata","author":"J. Klein","year":"2006","unstructured":"Klein, J., Baier, C.: Experiments with deterministic ?-automata for formulas of linear temporal logic. In: Farr\u00e9, J., Litovsky, I., Schmitz, S. (eds.) CIAA 2005. LNCS, vol.\u00a03845, pp. 199\u2013212. Springer, Heidelberg (2006)"},{"key":"26_CR11","first-page":"35","volume":"200","author":"Y. Kesten","year":"2005","unstructured":"Kesten, Y., Piterman, N., Pnueli, A.: Bridging the gap between fair simulation and trace containment. I&C\u00a0200, 35\u201361 (2005)","journal-title":"I&C"},{"key":"26_CR12","volume-title":"FOCS","author":"O. Kupferman","year":"2005","unstructured":"Kupferman, O., Vardi, M.Y.: Safraless decision procedures. In: FOCS. IEEE, Los Alamitos (2005)"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/BF01691063","volume":"3","author":"L.H. Landweber","year":"1969","unstructured":"Landweber, L.H.: Decision problems for \u03c9\u2013automata. MST\u00a03, 376\u2013384 (1969)","journal-title":"MST"},{"key":"26_CR14","unstructured":"L\u00f6ding, C.: Methods for the transformation of \u03c9-automata: Complexity and connection to second-order logic. Master Thesis, University of Kiel (1998)"},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"363","DOI":"10.2307\/1971035","volume":"65","author":"D.A. Martin","year":"1975","unstructured":"Martin, D.A.: Borel determinacy. Annals of Mathematics\u00a065, 363\u2013371 (1975)","journal-title":"Annals of Mathematics"},{"key":"26_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3190-6","volume-title":"Symbolic Model Checking","author":"K.L. McMillan","year":"1993","unstructured":"McMillan, K.L.: Symbolic Model Checking. Kluwer, Dordrecht (1993)"},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0304-3975(84)90049-5","volume":"32","author":"S. Miyano","year":"1984","unstructured":"Miyano, S., Hayashi, T.: Alternating finite automata on \u03c9-words. Theoretical Computer Science\u00a032, 321\u2013330 (1984)","journal-title":"Theoretical Computer Science"},{"key":"26_CR18","unstructured":"Michel, M.: Complementation is more difficult with automata on infinite words. In: CNET, Paris (1988)"},{"key":"26_CR19","volume-title":"LICS","author":"N. Piterman","year":"2006","unstructured":"Piterman, N.: From nondeterministic B\u00fcchi and Streett automata to deterministic parity automata. In: LICS. IEEE, Los Alamitos (to appear, 2006)"},{"key":"26_CR20","series-title":"Lecture Notes in Computer Science","first-page":"127","volume-title":"CONCUR 2003 - Concurrency Theory","author":"P. Madhusudan","year":"2003","unstructured":"Madhusudan, P., Alur, R., La Torre, S.: Playing games with boxes and diamonds. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 127\u2013141. Springer, Heidelberg (2003)"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Automata on infinite objects and Church\u2019s problem. American Mathematical Society (1972)","DOI":"10.1090\/cbms\/013"},{"key":"26_CR22","first-page":"81","volume":"77","author":"P.J.G. Ramadge","year":"1989","unstructured":"Ramadge, P.J.G., Wonham, W.M.: The control of discrete event systems. Trans. Control Theory\u00a077, 81\u201398 (1989)","journal-title":"Trans. Control Theory"},{"key":"26_CR23","volume-title":"FOCS","author":"S. Safra","year":"1988","unstructured":"Safra, S.: On the complexity of \u03c9-automata. In: FOCS. IEEE, Los Alamitos (1988)"},{"key":"26_CR24","series-title":"Lecture Notes in Computer Science","volume-title":"Correct Hardware Design and Verification Methods","author":"S. Tasiran","year":"1995","unstructured":"Tasiran, S., Hojati, R., Brayton, R.K.: Language containment using non-deterministic \u03c9-automata. In: Camurati, P.E., Eveking, H. (eds.) CHARME 1995. LNCS, vol.\u00a0987. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11874683_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:24:44Z","timestamp":1619508284000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11874683_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540454588","9783540454595"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11874683_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}