{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T03:06:38Z","timestamp":1725937598494},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319249520"},{"type":"electronic","value":"9783319249537"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-24953-7_29","type":"book-chapter","created":{"date-parts":[[2015,10,7]],"date-time":"2015-10-07T15:00:11Z","timestamp":1444230011000},"page":"394-410","source":"Crossref","is-referenced-by-count":13,"title":["Cooperative Reactive Synthesis"],"prefix":"10.1007","author":[{"given":"Roderick","family":"Bloem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00fcdiger","family":"Ehlers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"K\u00f6nighofer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,22]]},"reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-39212-2_3","volume-title":"Automata, Languages, and Programming","author":"S Almagor","year":"2013","unstructured":"Almagor, S., Boker, U., Kupferman, O.: Formalizing and reasoning about quality. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 15\u201327. Springer, Heidelberg (2013)"},{"issue":"5","key":"29_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. J. ACM 49(5), 672\u2013713 (2002)","journal-title":"J. ACM"},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-70918-3_17","volume-title":"STACS 2007","author":"D Berwanger","year":"2007","unstructured":"Berwanger, D.: Admissibility in infinite games. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 188\u2013199. Springer, Heidelberg (2007)"},{"issue":"3\u20134","key":"29_CR4","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s00236-013-0191-5","volume":"51","author":"R Bloem","year":"2014","unstructured":"Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T.A., Hofferek, G., Jobstmann, B., K\u00f6nighofer, B., K\u00f6nighofer, R.: Synthesizing robust systems. Acta Inf. 51(3\u20134), 193\u2013220 (2014)","journal-title":"Acta Inf."},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-642-02658-4_14","volume-title":"Computer Aided Verification","author":"R Bloem","year":"2009","unstructured":"Bloem, R., Chatterjee, K., Henzinger, T.A., Jobstmann, B.: Better quality in synthesis through quantitative objectives. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 140\u2013156. Springer, Heidelberg (2009)"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Bloem, R., Ehlers, R., Jacobs, S., K\u00f6nighofer, R.: How to handle assumptions in synthesis. In: SYNT, pp. 34\u201350 (2014)","DOI":"10.4204\/EPTCS.157.7"},{"key":"29_CR7","unstructured":"Bloem, R., Ehlers, R., K\u00f6nighofer, R.: Cooperative reactive synthesis. CoRR, abs\/1507.02531 (2015) Accessed on \n                    http:\/\/arxiv.org\/abs\/1507.02531"},{"issue":"3","key":"29_CR8","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1016\/j.jcss.2011.08.007","volume":"78","author":"R Bloem","year":"2012","unstructured":"Bloem, R., Jobstmann, B., Piterman, N., Pnueli, A., Sa\u2019ar, Y.: Synthesis of reactive(1) designs. J. Comput. Syst. Sci. 78(3), 911\u2013938 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-540-78499-9_11","volume-title":"Foundations of Software Science and Computational Structures","author":"M Droste","year":"2008","unstructured":"Droste, M., Quaas, K.: A kleene-sch\u00fctzenberger theorem for weighted timed automata. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol. 4962, pp. 142\u2013156. Springer, Heidelberg (2008)"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Brenguier, R., Raskin, J.-F., Sassolas, M.: The complexity of admissibility in omega-regular games. In: CSL-LICS, p. 23 (2014)","DOI":"10.1145\/2603088.2603143"},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-642-54013-4_5","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"K Chatterjee","year":"2014","unstructured":"Chatterjee, K., Doyen, L., Filiot, E., Raskin, J.-F.: Doomsday equilibria for omega-regular games. In: McMillan, K.L., Rival, X. (eds.) VMCAI 2014. LNCS, vol. 8318, pp. 78\u201397. Springer, Heidelberg (2014)"},{"key":"29_CR12","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. 4424, pp. 261\u2013275. Springer, Heidelberg (2007)"},{"issue":"6","key":"29_CR13","doi-asserted-by":"publisher","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":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-642-29860-8_34","volume-title":"Runtime Verification","author":"R Ehlers","year":"2012","unstructured":"Ehlers, R., Finkbeiner, B.: Monitoring realizability. In: Khurshid, S., Sen, K. (eds.) RV 2011. LNCS, vol. 7186, pp. 427\u2013441. Springer, Heidelberg (2012)"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Ehlers, R., K\u00f6nighofer, R., Bloem, R.: Synthesizing cooperative reactive mission plans. In: IROS, IEEE (2015)","DOI":"10.1109\/IROS.2015.7353862"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Ehlers, R., Topcu, U.: Resilience to intermittent assumption violations in reactive synthesis. In: HSCC, pp. 203\u2013212 (2014)","DOI":"10.1145\/2562059.2562128"},{"key":"29_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-642-03816-7_27","volume-title":"Mathematical Foundations of Computer Science 2009","author":"M Faella","year":"2009","unstructured":"Faella, M.: Admissible strategies in infinite games over graphs. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol. 5734, pp. 307\u2013318. Springer, Heidelberg (2009)"},{"key":"29_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-642-12002-2_16","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Fisman","year":"2010","unstructured":"Fisman, D., Kupferman, O., Lustig, Y.: Rational synthesis. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 190\u2013204. Springer, Heidelberg (2010)"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: POPL (1989)","DOI":"10.1145\/75277.75293"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24953-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:09:46Z","timestamp":1559275786000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24953-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319249520","9783319249537"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24953-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}