{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T07:51:59Z","timestamp":1764402719728,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,7,13]],"date-time":"2016-07-13T00:00:00Z","timestamp":1468368000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["FP7-279499"],"award-info":[{"award-number":["FP7-279499"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s00236-016-0273-2","type":"journal-article","created":{"date-parts":[[2016,7,13]],"date-time":"2016-07-13T14:19:06Z","timestamp":1468419546000},"page":"41-83","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Assume-admissible synthesis"],"prefix":"10.1007","volume":"54","author":[{"given":"Romain","family":"Brenguier","sequence":"first","affiliation":[]},{"given":"Jean-Fran\u00e7ois","family":"Raskin","sequence":"additional","affiliation":[]},{"given":"Ocan","family":"Sankur","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,13]]},"reference":[{"issue":"3","key":"273_CR1","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1051\/ita:2002013","volume":"36","author":"J Bernet","year":"2002","unstructured":"Bernet, J., Janin, D., Walukiewicz, I.: Permissive strategies: from parity games to safety games. RAIRO Theor. Inf. Appl. 36(3), 261\u2013275 (2002)","journal-title":"RAIRO Theor. Inf. Appl."},{"key":"273_CR2","doi-asserted-by":"crossref","unstructured":"Berwanger, D.: Admissibility in infinite games. In: Proceedings of STACS\u201907, vol. 4393 of LNCS, pp. 188\u2013199. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-70918-3_17"},{"key":"273_CR3","doi-asserted-by":"crossref","unstructured":"Bloem, R., Ehlers, R., Jacobs, S., K\u00f6nighofer, R.: How to handle assumptions in synthesis. In: SYNT\u201914, vol. 157 of EPTCS, pp. 34\u201350 (2014)","DOI":"10.4204\/EPTCS.157.7"},{"key":"273_CR4","doi-asserted-by":"publisher","unstructured":"Brandenburger, A., Friedenberg, A., Keisler, H.J.: Admissibility in Games1. Econometrica 76(2), 307\u2013352 (2008). doi: 10.1111\/j.1468-0262.2008.00835.x","DOI":"10.1111\/j.1468-0262.2008.00835.x"},{"key":"273_CR5","doi-asserted-by":"crossref","unstructured":"Brenguier, R., Raskin, J.-F., Sassolas, M.: The complexity of admissibility in omega-regular games. In: CSL-LICS \u201914, 2014. ACM (2014)","DOI":"10.1145\/2603088.2603143"},{"key":"273_CR6","unstructured":"Brenguier, R., Raskin, J.-F., Sankur, O.: Assume-admissible synthesis. In: Aceto L., de\u00a0Frutos\u00a0Escrig, D. (eds). 26th International Conference on Concurrency Theory (CONCUR 2015), vol.\u00a042 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 100\u2013113, Dagstuhl, Germany, 2015. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik"},{"key":"273_CR7","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, T.A.: Assume-guarantee synthesis. In: TACAS\u201907, vol. 4424 of LNCS. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-71209-1_21"},{"key":"273_CR8","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, T.A., Jobstmann, B.: Environment assumptions for synthesis. In: CONCUR 2008, vol. 5201 of LNCS, pp. 147\u2013161. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-85361-9_14"},{"issue":"1","key":"273_CR9","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.tcs.2006.07.032","volume":"365","author":"K Chatterjee","year":"2006","unstructured":"Chatterjee, K., Henzinger, T.A., Jurdzi\u0144ski, M.: Games with secure equilibria. Theor. Comput. Sci. 365(1), 67\u201382 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"273_CR10","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1016\/j.ic.2009.07.004","volume":"208","author":"K Chatterjee","year":"2010","unstructured":"Chatterjee, K., Henzinger, T.A., Piterman, N.: Strategy logic. Inf. Comput. 208(6), 677\u2013693 (2010)","journal-title":"Inf. Comput."},{"key":"273_CR11","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L., Filiot, E., Raskin, J.-F.: Doomsday equilibria for omega-regular games. In: VMCAI\u201914, vol. 8318, pp. 78\u201397. Springer, Berlin (2014)","DOI":"10.1007\/978-3-642-54013-4_5"},{"key":"273_CR12","doi-asserted-by":"crossref","unstructured":"Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching-time temporal logic. In: Logics of Programs, vol. 131 of LNCS, pp. 52\u201371. Springer, Berlin (1981)","DOI":"10.1007\/BFb0025774"},{"key":"273_CR13","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL\u201977. ACM (1977)","DOI":"10.1145\/512950.512973"},{"key":"273_CR14","doi-asserted-by":"crossref","unstructured":"Damm, W., Finkbeiner, B.: Automatic compositional synthesis of distributed systems. In: FM 2014, vol. 8442 of LNCS, pp. 179\u2013193. Springer, Berlin (2014)","DOI":"10.1007\/978-3-319-06410-9_13"},{"key":"273_CR15","doi-asserted-by":"crossref","unstructured":"de\u00a0Alfaro, L., Godefroid, P., Jagadeesan, R.: Three-valued abstractions of games: Uncertainty, but with precision. In: LICS\u201904. IEEE (2004)","DOI":"10.1109\/LICS.2004.1319611"},{"key":"273_CR16","doi-asserted-by":"crossref","unstructured":"Emerson, E.A.: Temporal and modal logic. Handb. Theor. Comput. Sci. Vol. B Formal Models Semat B 995, 1072 (1990)","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"key":"273_CR17","doi-asserted-by":"crossref","unstructured":"Faella, M.: Admissible strategies in infinite games over graphs. In: MFCS 2009, vol. 5734 of Lecture Notes in Computer Science. pp. 307\u2013318. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-03816-7_27"},{"key":"273_CR18","doi-asserted-by":"crossref","unstructured":"Fisman, D., Kupferman, O., Lustig, Y.: Rational synthesis. In: TACAS\u201910, vol. 6015 of LNCS, pp. 190\u2013204. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-12002-2_16"},{"key":"273_CR19","unstructured":"Fudenberg, D., Tirole, J.: Game: Theory. MIT, Press, Cambridge, 1991 Translated into Chinesse by Renin University Press, Bejing (1991)"},{"key":"273_CR20","volume-title":"Game Theory in Wireless and Communication Networks: Theory, Models, and Applications","author":"Z Han","year":"2012","unstructured":"Han, Z.: Game Theory in Wireless and Communication Networks: Theory, Models, and Applications. Cambridge University Press, UK (2012)"},{"key":"273_CR21","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Majumdar, R., Mang, F.Y.C., Raskin, J.-F.: Abstract interpretation of game properties. In: SAS, pp. 220\u2013239 (2000)","DOI":"10.1007\/978-3-540-45099-3_12"},{"key":"273_CR22","unstructured":"Hunter, P.: Complexity and Infinite Games on Finite Graphs. Ph.D thesis, Computer Laboratory, University of Cambridge (2007)"},{"key":"273_CR23","doi-asserted-by":"crossref","unstructured":"Hunter, P., Dawar, A.: Complexity bounds for regular games. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS\u201905, vol. 3618 of LNCS. Springer, Berlin (2005)","DOI":"10.1007\/11549345_43"},{"key":"273_CR24","doi-asserted-by":"crossref","unstructured":"Kupferman, O., Perelli, G., Vardi, M.Y.: Synthesis with rational environments. In: Proceedings of 12th European conference on multi-agent systems, LNCS. Springer, Berlin (2014)","DOI":"10.1007\/978-3-319-17130-2_15"},{"key":"273_CR25","doi-asserted-by":"crossref","unstructured":"Long, D.E., Browne, A., Clarke, E.M., Jha, S., Marrero, W.R.: An improved algorithm for the evaluation of fixpoint expressions. In: CAV\u201994, vol. 818 of LNCS. Springer, Berlin (1994)","DOI":"10.1007\/3-540-58179-0_66"},{"key":"273_CR26","doi-asserted-by":"crossref","unstructured":"Manna, Z., Wolper, P.: Synthesis of communicating processes from temporal logic specifications. In: Logics of Programs, vol. 131 of LNCS, pp. 253\u2013281. Springer, Berlin (1981)","DOI":"10.1007\/BFb0025786"},{"key":"273_CR27","unstructured":"Mogavero, F., Murano, A., Vardi, M.Y.: Reasoning about strategies. In: FSTTCS 2010, vol.\u00a08 of LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2010)"},{"key":"273_CR28","doi-asserted-by":"crossref","unstructured":"Nash, J.: Equilibrium points in $$n$$ n -person games. In: Proceedings of NAS (1950)","DOI":"10.1073\/pnas.36.1.48"},{"key":"273_CR29","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.tcs.2014.01.017","volume":"560","author":"D Neider","year":"2014","unstructured":"Neider, D., Rabinovich, R., Zimmermann, M.: Down the borel hierarchy: solving muller games via safety games. Theor. Comput. Sci. 560, 219\u2013234 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"273_CR30","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: Foundations of Computer Science, 1977, 18th Annual Symposium on, pp. 46\u201357. IEEE (1977)","DOI":"10.1109\/SFCS.1977.32"},{"issue":"6","key":"273_CR31","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0020-0190(96)00130-5","volume":"59","author":"H Seidl","year":"1996","unstructured":"Seidl, H.: Fast and simple nested fixpoints. Inf. Proc. Lett. 59(6), 303\u2013308 (1996)","journal-title":"Inf. Proc. Lett."},{"key":"273_CR32","doi-asserted-by":"crossref","DOI":"10.5117\/9789085550402","volume-title":"Stochastic Multiplayer Games: Theory and Algorithms","author":"M Ummels","year":"2010","unstructured":"Ummels, M.: Stochastic Multiplayer Games: Theory and Algorithms. Amsterdam University Press, UK (2010)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-016-0273-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-016-0273-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-016-0273-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-016-0273-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T23:40:02Z","timestamp":1568158802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-016-0273-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,13]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["273"],"URL":"https:\/\/doi.org\/10.1007\/s00236-016-0273-2","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[2016,7,13]]}}}