{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T21:44:37Z","timestamp":1755035077931},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291312"},{"type":"electronic","value":"9783540319399"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561163_7","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T10:54:31Z","timestamp":1127818471000},"page":"141-161","source":"Crossref","is-referenced-by-count":3,"title":["Games with Secure Equilibria,"],"prefix":"10.1007","author":[{"given":"Krishnendu","family":"Chatterjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcin","family":"Jurdzi\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1145\/203095.201069","volume":"17","author":"M. Abadi","year":"1995","unstructured":"Abadi, M., Lamport, L.: Conjoining specifications. ACM Transactions on Programming Languages and Systems\u00a017, 507\u2013534 (1995)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1008739929481","volume":"15","author":"R. Alur","year":"1999","unstructured":"Alur, R., Henzinger, T.A.: Reactive modules. Formal Methods in System Design\u00a015, 7\u201348 (1999)","journal-title":"Formal Methods in System Design"},{"key":"7_CR3","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":"7_CR4","series-title":"Logic in Computer Science (LICS)","first-page":"99","volume-title":"How much memory is needed to win infinite games?","author":"S. Dziembowski","year":"1997","unstructured":"Dziembowski, S., Jurdzi\u0144ski, M., Walukiewicz, I.: How much memory is needed to win infinite games? Logic in Computer Science (LICS), pp. 99\u2013110. IEEE Computer Society Press, Los Alamitos (1997)"},{"key":"7_CR5","first-page":"328","volume-title":"Foundations of Computer Science (FOCS)","author":"E.A. Emerson","year":"1988","unstructured":"Emerson, E.A., Jutla, C.: The complexity of tree automata and logics of programs. In: Foundations of Computer Science (FOCS), pp. 328\u2013337. IEEE Computer Society Press, Los Alamitos (1988)"},{"key":"7_CR6","first-page":"368","volume-title":"Foundations of Computer Science(FOCS)","author":"E.A. Emerson","year":"1991","unstructured":"Emerson, E.A., Jutla, C.: Tree automata, \u03bc-calculus, and determinacy. In: Foundations of Computer Science(FOCS), pp. 368\u2013377. IEEE Computer Society Press, Los Alamitos (1991)"},{"key":"7_CR7","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":"7_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4190-4","volume-title":"Classical Descriptive Set Theory","author":"A. Kechris","year":"1995","unstructured":"Kechris, A.: Classical Descriptive Set Theory. Springer, Heidelberg (1995)"},{"key":"7_CR9","doi-asserted-by":"crossref","DOI":"10.1515\/9780691215747","volume-title":"A Course in Microeconomic Theory","author":"D.M. Kreps","year":"1990","unstructured":"Kreps, D.M.: A Course in Microeconomic Theory. Princeton University Press, Princeton (1990)"},{"key":"7_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0931-7","volume-title":"The Temporal Logic of Reactive and Concurrent Systems: Specification","author":"Z. Manna","year":"1992","unstructured":"Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, Heidelberg (1992)"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"363","DOI":"10.2307\/1971035","volume":"102","author":"D.A. Martin","year":"1975","unstructured":"Martin, D.A.: Borel determinacy. Annals of Mathematics\u00a0102, 363\u2013371 (1975)","journal-title":"Annals of Mathematics"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.2307\/2586667","volume":"63","author":"D.A. Martin","year":"1998","unstructured":"Martin, D.A.: The determinacy of Blackwell games. Journal of Symbolic Logic\u00a063, 1565\u20131581 (1998)","journal-title":"Journal of Symbolic Logic"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","first-page":"423","volume-title":"CONCUR 2003 - Concurrency Theory","author":"K. Namjoshi","year":"2003","unstructured":"Namjoshi, K., Amla, N., Emerson, E.A., Trefler, R.: Abstract patterns of compositional reasoning. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 423\u2013448. Springer, Heidelberg (2003)"},{"key":"7_CR14","volume-title":"Game Theory","author":"G. Owen","year":"1995","unstructured":"Owen, G.: Game Theory. Academic Press, London (1995)"},{"key":"7_CR15","first-page":"179","volume-title":"Principles of Programming Languages (POPL)","author":"A. Pnueli","year":"1989","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Principles of Programming Languages (POPL), pp. 179\u2013190. ACM Press, New York (1989)"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-60275-5","volume-title":"STACS 95","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":"7_CR17","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Languages","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a03, pp. 389\u2013455. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods for Components and Objects"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561163_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,17]],"date-time":"2021-07-17T23:38:47Z","timestamp":1626565127000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561163_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291312","9783540319399"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11561163_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}