{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,24]],"date-time":"2026-09-24T16:31:30Z","timestamp":1790267490891,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540744061","type":"print"},{"value":"9783540744078","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74407-8_5","type":"book-chapter","created":{"date-parts":[[2007,8,18]],"date-time":"2007-08-18T14:30:48Z","timestamp":1187447448000},"page":"59-73","source":"Crossref","is-referenced-by-count":38,"title":["Strategy Logic"],"prefix":"10.1007","author":[{"given":"Krishnendu","family":"Chatterjee","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nir","family":"Piterman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0035748","volume-title":"Automata, Languages and Programming","author":"M. Abadi","year":"1989","unstructured":"Abadi, M., Lamport, L., Wolper, P.: Realizable and unrealizable concurrent program specifications. In: Ronchi Della Rocca, S., Ausiello, G., Dezani-Ciancaglini, M. (eds.) Automata, Languages and Programming. LNCS, vol.\u00a0372, pp. 1\u201317. Springer, Heidelberg (1989)"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R. Alur","year":"2002","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. Journal of the ACM\u00a049, 672\u2013713 (2002)","journal-title":"Journal of the ACM"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/11759744_3","volume-title":"Formal Approaches to Software Testing","author":"A. Blass","year":"2006","unstructured":"Blass, A., Gurevich, Y., Nachmanson, L., Veanes, M.: Play to test. In: Grieskamp, W., Weise, C. (eds.) FATES 2005. LNCS, vol.\u00a03997, pp. 32\u201346. Springer, Heidelberg (2006)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/978-3-540-71209-1_21","volume-title":"30th TACAS","author":"K. Chatterjee","year":"2007","unstructured":"Chatterjee, K., Henzinger, T.A.: Assume guarantee synthesis. In: 30th TACAS. LNCS, vol.\u00a04424, pp. 261\u2013275. Springer, Heidelberg (2007)"},{"key":"5_CR5","first-page":"160","volume-title":"19th LICS","author":"K. Chatterjee","year":"2004","unstructured":"Chatterjee, K., Henzinger, T.A., Jurdzi\u0144ski, M.: Games with secure equilibria. In: 19th LICS, pp. 160\u2013169. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"5_CR6","unstructured":"Chatterjee, K., Henzinger, T.A., Piterman, N.: Strategy logic. Technical Report UCB\/EECS-2007-78, UC Berkeley (2007)"},{"key":"5_CR7","first-page":"109","volume-title":"9th FASE","author":"L. Alfaro de","year":"2001","unstructured":"de Alfaro, L., Henzinger, T.A.: Interface automata. In: 9th FASE, pp. 109\u2013120. ACM Press, New York (2001)"},{"key":"5_CR8","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6874.001.0001","volume-title":"Trace theory for automatic hierarchical verification of speed independent circuits","author":"D.L. Dill","year":"1989","unstructured":"Dill, D.L.: Trace theory for automatic hierarchical verification of speed independent circuits. MIT Press, Cambridge (1989)"},{"key":"5_CR9","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":"5_CR10","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1145\/567446.567462","volume-title":"7th POPL","author":"D. Gabbay","year":"1980","unstructured":"Gabbay, D., Pnueli, A., Shelah, S., Stavi, J.: On the temporal analysis of fairness. In: 7th POPL, pp. 163\u2013173. ACM Press, New York (1980)"},{"issue":"1","key":"5_CR11","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1006\/inco.2001.3085","volume":"173","author":"T.A. Henzinger","year":"2002","unstructured":"Henzinger, T.A., Kupferman, O., Rajamani, S.: Fair simulation. Information and Computation\u00a0173(1), 64\u201381 (2002)","journal-title":"Information and Computation"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/11874683_27","volume-title":"Computer Science Logic","author":"L. Kaiser","year":"2006","unstructured":"Kaiser, L.: Game quantification on automatic structures and hierarchical model checking games. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 411\u2013425. Springer, Heidelberg (2006)"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"J.F. Nash Jr.","year":"1950","unstructured":"Nash Jr., J.F.: Equilibrium points in n-person games. Proceedings of the National Academy of Sciences\u00a036, 48\u201349 (1950)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"5_CR14","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. Jurdzi\u0144ski","year":"2000","unstructured":"Jurdzi\u0144ski, 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":"5_CR15","unstructured":"Kamp, J.A.W.: Tense Logic and the Theory of Order. PhD thesis, UCLA (1968)"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"Kozen, D.: Results on the propositional \u03bc-calculus. Theoretical Computer Science\u00a027, 333\u2013354 (1983)","journal-title":"Theoretical Computer Science"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1006\/inco.2000.2893","volume":"164","author":"O. Kupferman","year":"2001","unstructured":"Kupferman, O., Vardi, M.Y., Wolper, P.: Module checking. Information and Computation\u00a0164, 322\u2013344 (2001)","journal-title":"Information and Computation"},{"key":"5_CR18","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":"5_CR19","unstructured":"Milner, R.: An algebraic definition of simulation between programs. In: 2nd IJCAI, pp. 481\u2013489. British Computer Society (1971)"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(87)90133-2","volume":"54","author":"D.E. Muller","year":"1987","unstructured":"Muller, D.E., Schupp, P.E.: Alternating automata on infinite trees. Theoretical Computer Science\u00a054, 267\u2013276 (1987)","journal-title":"Theoretical Computer Science"},{"key":"5_CR21","volume-title":"Game Theory","author":"G. Owen","year":"1995","unstructured":"Owen, G.: Game Theory. Academic Press, London (1995)"},{"key":"5_CR22","first-page":"179","volume-title":"16th POPL","author":"A. Pnueli","year":"1989","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: 16th POPL, pp. 179\u2013190. ACM Press, New York (1989)"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/1995086","volume":"141","author":"M.O. Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second order theories and automata on infinite trees. Transaction of the AMS\u00a0141, 1\u201335 (1969)","journal-title":"Transaction of the AMS"},{"key":"5_CR24","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. IEEE Transactions on Control Theory\u00a077, 81\u201398 (1989)","journal-title":"IEEE Transactions on Control Theory"},{"key":"5_CR25","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":"5_CR26","series-title":"Beyond Words","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Languages, ch. 7","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata, and logic. In: Handbook of Formal Languages, ch. 7. Beyond Words, vol.\u00a03, pp. 389\u2013455. Springer, Heidelberg (1997)"},{"issue":"1","key":"5_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1994.1092","volume":"115","author":"M.Y. Vardi","year":"1994","unstructured":"Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. Information and Computation\u00a0115(1), 1\u201337 (1994)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2007 \u2013 Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74407-8_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:25:08Z","timestamp":1619519108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74407-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744061","9783540744078"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74407-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}