{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:43:56Z","timestamp":1725493436639},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540763352"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76336-9_24","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T05:44:48Z","timestamp":1193463888000},"page":"253-264","source":"Crossref","is-referenced-by-count":3,"title":["Memory Reduction for Strategies in Infinite Games"],"prefix":"10.1007","author":[{"given":"Michael","family":"Holtmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christof","family":"L\u00f6ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","first-page":"356","volume-title":"Proceedings of the 19th LICS","author":"I. Walukiewicz","year":"2004","unstructured":"Walukiewicz, I.: A landscape with games in the background. In: Proceedings of the 19th LICS, pp. 356\u2013366. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"24_CR2","first-page":"3","volume-title":"Proceedings of the Fourth Annual Symposium on Switching Circuit Theory and Logical Design","author":"D.E. Muller","year":"1963","unstructured":"Muller, D.E.: Infinite sequences and finite machines. In: Proceedings of the Fourth Annual Symposium on Switching Circuit Theory and Logical Design, Chicago, Illinois, pp. 3\u201316. IEEE Computer Society Press, Los Alamitos (1963)"},{"key":"24_CR3","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.: Solving sequential conditions by finite-state strategies. Transactions of the AMS\u00a0138, 295\u2013311 (1969)","journal-title":"Transactions of the AMS"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Gurevich, Y., Harrington, L.: Trees, automata and games. In: Proceedings of the 14th STOC, San Francisco, CA, pp. 60\u201365 (1982)","DOI":"10.1145\/800070.802177"},{"key":"24_CR5","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":"24_CR6","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. Theoretical Computer Science\u00a0200, 135\u2013183 (1998)","journal-title":"Theoretical Computer Science"},{"key":"24_CR7","first-page":"99","volume-title":"Proceedings of the 12th LICS","author":"S. Dziembowski","year":"1997","unstructured":"Dziembowski, S., Jurdzi\u0144ski, M., Walukiewicz, I.: How much memory is needed to win infinite games? In: Proceedings of the 12th LICS, Washington - Brussels - Tokyo, pp. 99\u2013110. IEEE Computer Society Press, Los Alamitos (1997)"},{"key":"24_CR8","unstructured":"Horn, F.: Streett games on finite graphs. GDV (2005)"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/3-540-45089-0_3","volume-title":"Implementation and Application of Automata","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":"24_CR10","unstructured":"Holtmann, M.: Memory reduction for strategies in infinite games. Diploma Thesis (revised version), RWTH Aachen (2007), http:\/\/www-i7.informatik.rwth-aachen.de\/~holtmann\/"},{"key":"24_CR11","unstructured":"Thomas, W.: Languages, automata, and logic. Technical report, Christian-Albrechts-Universit\u00e4t Kiel, Institut f\u00fcr Informatik und Praktische Mathematik (1996)"},{"key":"24_CR12","unstructured":"Chatterjee, K.: Linear time algorithm for weak parity games. Technical report, EECS Department, University of California, Berkeley (2006)"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/3-540-45657-0_5","volume-title":"Computer Aided Verification","author":"W. Thomas","year":"2002","unstructured":"Thomas, W.: Infinite games and verification. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 58\u201364. Springer, Heidelberg (2002)"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E.: An nlogn-algorithm for minimizing states in a finite automaton. Technical report, Stanford University, Department of Computer Science (1971)","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"24_CR15","volume-title":"Switching and Finite Automata Theory","author":"Z. Kohavi","year":"1970","unstructured":"Kohavi, Z.: Switching and Finite Automata Theory. McGraw-Hill, New York (1970)"},{"key":"24_CR16","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. IPL\u00a079, 105\u2013109 (2001)","journal-title":"IPL"},{"key":"24_CR17","unstructured":"Wallmeier, N.: Symbolische Synthese zustandsbasierter reaktiver Programme. Diplomarbeit, RWTH Aachen (2003)"},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1137\/S0097539703420675","volume":"34","author":"K. Etessami","year":"2005","unstructured":"Etessami, K., Wilke, T., Schuller, R.A.: Fair simulation relations, parity games, and state space reduction for B\u00fcchi automata. SIAM Journal on Computing\u00a034, 1159\u20131175 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"24_CR19","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, T.: 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)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76336-9_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:48:10Z","timestamp":1619520490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76336-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540763352"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76336-9_24","relation":{},"subject":[]}}