{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T07:47:56Z","timestamp":1764402476935,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642120015"},{"type":"electronic","value":"9783642120022"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12002-2_16","type":"book-chapter","created":{"date-parts":[[2010,3,8]],"date-time":"2010-03-08T01:20:25Z","timestamp":1268011225000},"page":"190-204","source":"Crossref","is-referenced-by-count":59,"title":["Rational Synthesis"],"prefix":"10.1007","author":[{"given":"Dana","family":"Fisman","sequence":"first","affiliation":[]},{"given":"Orna","family":"Kupferman","sequence":"additional","affiliation":[]},{"given":"Yoad","family":"Lustig","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/11560548_7","volume-title":"Correct Hardware Design and Verification Methods","author":"A. Chakrabarti","year":"2005","unstructured":"Chakrabarti, A., Chatterjee, K., Henzinger, T.A., Kupferman, O., Majumdar, R.: Verifying quantitative properties using bound functions. In: Borrione, D., Paul, W. (eds.) CHARME 2005. LNCS, vol.\u00a03725, pp. 50\u201364. Springer, Heidelberg (2005)"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.: Quantative languages. In: Proc. 17th Annual Conf. of the European Association for Computer Science Logic (2008)","DOI":"10.1007\/978-3-540-87531-4_28"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, T., Jobstmann, B.: Environment assumptions for synthesis. In: 19th Int. Conf. on Concurrency Theory, pp. 147\u2013161 (2008)","DOI":"10.1007\/978-3-540-85361-9_14"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, T., Jurdzinski, M.: Games with secure equilibria. Theoretical Computer Science (2006)","DOI":"10.1007\/11561163_7"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, T.A., Piterman, N.: Strategy logic. In: 18th Int. Conf. on Concurrency Theory, pp. 59\u201373 (2007)","DOI":"10.1007\/978-3-540-74407-8_5"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-540-71209-1_21","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K. Chatterjee","year":"2007","unstructured":"Chatterjee, K., Henzinger, T.A.: Assume-guarantee synthesis. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, pp. 261\u2013275. Springer, Heidelberg (2007)"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-540-30124-0_6","volume-title":"Computer Science Logic","author":"K. Chatterjee","year":"2004","unstructured":"Chatterjee, K., Majumdar, R., Jurdzinski, M.: On Nash equilibria in stochastic games. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol.\u00a03210, pp. 26\u201340. Springer, Heidelberg (2004)"},{"key":"16_CR8","unstructured":"Church, A.: Logic, arithmetics, and automata. In: Proc. Int. Congress of Mathematicians, 1962, pp. 23\u201335. Institut Mittag-Leffler (1963)"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Logics, and Infinite Games","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol.\u00a02500. Springer, Heidelberg (2002)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Gurevich, Y., Harrington, L.: Trees, automata, and games. In: Proc. 14th ACM Symp. on Theory of Computing, pp. 60\u201365 (1982)","DOI":"10.1145\/800070.802177"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Gurfinkel, A., Chechik, M.: Multi-valued model-checking via classical model-checking. In: 14th Int. Conf. on Concurrency Theory, pp. 263\u2013277 (2003)","DOI":"10.1007\/978-3-540-45187-7_18"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-69738-1_14","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"O. Kupferman","year":"2007","unstructured":"Kupferman, O., Lustig, Y.: Lattice automata. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol.\u00a04349, pp. 199\u2013213. Springer, Heidelberg (2007)"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-540-75596-8_23","volume-title":"Automated Technology for Verification and Analysis","author":"O. Kupferman","year":"2007","unstructured":"Kupferman, O., Lustig, Y.: Latticed simulation relations and games. In: Namjoshi, K.S., Yoneda, T., Higashino, T., Okamura, Y. (eds.) ATVA 2007. LNCS, vol.\u00a04762, pp. 316\u2013330. Springer, Heidelberg (2007)"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Kupferman, O., Vardi, M.Y.: Weak alternating automata and tree automata emptiness. In: Proc. 30th ACM Symp. on Theory of Computing, pp. 224\u2013233 (1998)","DOI":"10.1145\/276698.276748"},{"issue":"2","key":"16_CR15","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/1055686.1055689","volume":"6","author":"O. Kupferman","year":"2005","unstructured":"Kupferman, O., Vardi, M.Y.: From linear time to branching time. ACM Transactions on Computational Logic\u00a06(2), 273\u2013294 (2005)","journal-title":"ACM Transactions on Computational Logic"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Kupferman, O., Vardi, M.Y.: Memoryful branching-time logics. In: Proc. 21st IEEE Symp. on Logic in Computer Science, pp. 265\u2013274 (2006)","DOI":"10.1109\/LICS.2006.34"},{"key":"16_CR17","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":"16_CR18","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":"16_CR19","doi-asserted-by":"crossref","unstructured":"Nash, J.F.: Equilibrium points in n-person games. In: Proceedings of the National Academy of Sciences of the United States of America (1950)","DOI":"10.1073\/pnas.36.1.48"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. In: Proc. 31st ACM Symp. on Theory of Computing, pp. 129\u2013140 (1999)","DOI":"10.1145\/301250.301287"},{"key":"16_CR21","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N. Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"key":"16_CR22","volume-title":"A Course in Game Theory","author":"M.J. Osborne","year":"1994","unstructured":"Osborne, M.J., Rubinstein, A.: A Course in Game Theory. The MIT Press, Cambridge (1994)"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proc. 18th IEEE Symp. on Foundations of Computer Science, pp. 46\u201357 (1977a)","DOI":"10.1109\/SFCS.1977.32"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proc. 16th ACM Symp. on Principles of Programming Languages, pp. 179\u2013190 (1989)","DOI":"10.1145\/75277.75293"},{"key":"16_CR25","unstructured":"Rosner, R.: Modular Synthesis of Reactive Systems. PhD thesis, Weizmann Institute of Science (1992)"},{"issue":"1","key":"16_CR26","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF01766400","volume":"4","author":"R. Selten","year":"1975","unstructured":"Selten, R.: Reexamination of the perfectness concept for equilibrium points in extensive games. International Journal of Game Theory\u00a04(1), 25\u201355 (1975)","journal-title":"International Journal of Game Theory"},{"key":"16_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/11562948_27","volume-title":"Automated Technology for Verification and Analysis","author":"S. Shoham","year":"2005","unstructured":"Shoham, S., Grumberg, O.: Multi-valued model checking games. In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol.\u00a03707, pp. 354\u2013369. Springer, Heidelberg (2005)"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Ummels, M.: Rational behaviour and strategy construction in infinite multiplayer games. In: Proc. 26th Conf. on Foundations of Software Technology and Theoretical Computer Science, pp. 212\u2013223 (2006)","DOI":"10.1007\/11944836_21"},{"issue":"1","key":"16_CR29","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","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12002-2_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T01:39:00Z","timestamp":1739929140000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12002-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642120015","9783642120022"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12002-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}