{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:42:44Z","timestamp":1725500564255},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540775652"},{"type":"electronic","value":"9783540775669"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77566-9_10","type":"book-chapter","created":{"date-parts":[[2008,1,5]],"date-time":"2008-01-05T06:18:43Z","timestamp":1199513923000},"page":"118-123","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing Winning Strategies in Regular Infinite Games"],"prefix":"10.1007","author":[{"given":"Wolfgang","family":"Thomas","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1145\/377978.377990","volume":"2","author":"R. Alur","year":"2001","unstructured":"Alur, R., Etessami, K., La Torre, S., Peled, D.: Parametric temporal logic for \u201cmodel measuring\u201d. ACM Trans. Comput. Logic\u00a02, 388\u2013407 (2001)","journal-title":"ACM Trans. Comput. Logic"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"367","DOI":"10.2307\/1994916","volume":"138","author":"J.R. B\u00fcchi","year":"1969","unstructured":"B\u00fcchi, J.R., Landweber, L.H.: Solving sequential conditions by finite-state strategies. Trans. Amer. Math. Soc.\u00a0138, 367\u2013378 (1969)","journal-title":"Trans. Amer. Math. Soc."},{"key":"10_CR3","first-page":"99","volume-title":"Proc. 12th IEEE Symp. on Logic in Computer Science","author":"S. Dziembowski","year":"1997","unstructured":"Dziembowski, S., Jurdzi\u0144ski, M., Walukiewicz, I.: How much memory is needed to win infinite games? In: Proc. 12th IEEE Symp. on Logic in Computer Science, pp. 99\u2013110. IEEE Computer Society Press, Los Alamitos (1997)"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1137\/S0097539703420675","volume":"34","author":"K. Etessami","year":"2005","unstructured":"Etessami, K., Wilke, Th., Schuller, R.A.: Fair bismulation relations, parity games, and state space reduction for B\u00fcchi automata. SIAM J. Comput.\u00a034, 1159\u20131175 (2005)","journal-title":"SIAM J. Comput."},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11779148_7","volume-title":"Developments in Language Theory","author":"C. Fritz","year":"2006","unstructured":"Fritz, C., Wilke, Th.: Simulation relations for alternating parity automata and parity games. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 59\u201370. Springer, Heidelberg (2006)"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/978-3-540-76336-9_24","volume-title":"CIAA 2007","author":"M. Holtmann","year":"2007","unstructured":"Holtmann, M., L\u00f6ding, C.: Memory reduction for strategies in infinite games. In: Holub, J., \u017dd\u2019\u00e1rek, J. (eds.) CIAA 2007. LNCS, vol.\u00a04783, pp. 253\u2013264. Springer, Heidelberg (2007)"},{"key":"10_CR7","unstructured":"Holtmann, M.: Memory Reduction for Strategies in Infinite Games, Diploma thesis, RWTH Aachen 2007, \n \n http:\/\/www.automata.rwth-aachen.de\/~holtmann\/"},{"key":"10_CR8","unstructured":"Horn, F., Thomas, W., Wallmeier, N.: Optimal strategy synthesis for request-response games (submitted)"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0020-0190(00)00183-6","volume":"79","author":"C. L\u00f6ding","year":"2001","unstructured":"L\u00f6ding, C.: Efficient minimization of deterministic weak \u03c9-automata. Inf. Proc. Lett.\u00a079, 105\u2013109 (2001)","journal-title":"Inf. Proc. Lett."},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-60275-5","volume-title":"STACS 1995","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":"10_CR11","unstructured":"Wallmeier, N.: Strategien in unendlichen Spielen mit Liveness-Gewinnbedingungen: Syntheseverfahren, Optimierung und Implementierung, Dissertation, RWTH Aachen (2007)"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/3-540-45089-0_3","volume-title":"CIAA 2003","author":"N. Wallmeier","year":"2003","unstructured":"Wallmeier, N., H\u00fctten, P., Thomas, W.: Symbolic synthesis of finite-state controllers for request-response specifications. In: Ibarra, O.H., Dang, Z. (eds.) CIAA 2003. LNCS, vol.\u00a02759, pp. 11\u201322. Springer, Heidelberg (2003)"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(98)00009-7","volume":"200","author":"W. Zielonka","year":"1998","unstructured":"Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theor. Comput. Sci.\u00a0200, 135\u2013183 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0304-3975(95)00188-3","volume":"158","author":"U. Zwick","year":"1996","unstructured":"Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Theor. Comput. Sci.\u00a0158, 259\u2013343 (1996)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2008: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77566-9_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:44:49Z","timestamp":1619520289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77566-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540775652","9783540775669"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77566-9_10","relation":{},"subject":[]}}