{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:48:40Z","timestamp":1725738520881},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392115"},{"type":"electronic","value":"9783642392122"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39212-2_25","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T13:09:19Z","timestamp":1372770559000},"page":"263-274","source":"Crossref","is-referenced-by-count":1,"title":["Strategy Composition in Compositional Games"],"prefix":"10.1007","author":[{"given":"Marcus","family":"Gelderie","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1090\/S0002-9947-1969-0280205-0","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. of the AMS\u00a0138, 295\u2013311 (1969)","journal-title":"Trans. of the AMS"},{"issue":"2","key":"25_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0168-0072(93)90036-D","volume":"65","author":"R. McNaughton","year":"1993","unstructured":"McNaughton, R.: Infinite games played on finite graphs. Annals of Pure and Applied Logic\u00a065(2), 149\u2013184 (1993)","journal-title":"Annals of Pure and Applied Logic"},{"key":"25_CR3","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."},{"volume-title":"Automata logics, and infinite games: a guide to current research","year":"2002","key":"25_CR4","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata logics, and infinite games: a guide to current research. Springer, New York (2002)"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"L\u00f6ding, C.: Infinite games and automata theory. In: Apt, K.R., Gr\u00e4del, E. (eds.) Lectures in Game Theory for Computer Scientists. Cambridge U. P. (2011)","DOI":"10.1017\/CBO9780511973468.003"},{"key":"25_CR6","unstructured":"Baier, C., Katoen, J.: Principles of Model Checking. MIT Press (2008)"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-33386-6_18","volume-title":"Automated Technology for Verification and Analysis","author":"J. Fearnley","year":"2012","unstructured":"Fearnley, J., Peled, D., Schewe, S.: Synthesis of succinct systems. In: Chakraborty, S., Mukund, M. (eds.) ATVA 2012. LNCS, vol.\u00a07561, pp. 208\u2013222. Springer, Heidelberg (2012)"},{"issue":"2","key":"25_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1006\/inco.2001.2920","volume":"173","author":"D. Harel","year":"2002","unstructured":"Harel, D., Kupferman, O., Vardi, M.Y.: On the complexity of verifying concurrent transition systems. Inf. Comput.\u00a0173(2), 143\u2013161 (2002)","journal-title":"Inf. Comput."},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-642-32589-2_39","volume-title":"Mathematical Foundations of Computer Science 2012","author":"M. Gelderie","year":"2012","unstructured":"Gelderie, M.: Strategy machines and their complexity. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol.\u00a07464, pp. 431\u2013442. Springer, Heidelberg (2012)"},{"issue":"1","key":"25_CR10","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/S1571-0661(04)00220-8","volume":"52","author":"D.Q. Goldin","year":"2001","unstructured":"Goldin, D.Q., Smolka, S.A., Wegner, P.: Turing machines, transition systems, and interaction. Electr. Notes Theor. Comput. Sci.\u00a052(1), 120\u2013136 (2001)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/11549345_43","volume-title":"Mathematical Foundations of Computer Science 2005","author":"P. Hunter","year":"2005","unstructured":"Hunter, P., Dawar, A.: Complexity bounds for regular games (extended abstract). In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 495\u2013506. Springer, Heidelberg (2005)"},{"key":"25_CR12","unstructured":"Dawar, A., Horn, F., Hunter, P.: Complexity Bounds for Muller Games. Theoretical Computer Science (2011) (submitted)"},{"key":"25_CR13","unstructured":"Horn, F.: Explicit Muller Games are PTIME. In: FSTTCS, pp. 235\u2013243 (2008)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39212-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,2]],"date-time":"2023-07-02T20:46:46Z","timestamp":1688330806000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39212-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392115","9783642392122"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39212-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}