{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T11:35:04Z","timestamp":1791459304823,"version":"4.3.4"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030174644","type":"print"},{"value":"9783030174651","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17465-1_13","type":"book-chapter","created":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T22:50:37Z","timestamp":1554331837000},"page":"229-246","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Environmentally-Friendly GR(1) Synthesis"],"prefix":"10.1007","author":[{"given":"Rupak","family":"Majumdar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nir","family":"Piterman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anne-Kathrin","family":"Schmuck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,4,3]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-319-63390-9_19","volume-title":"Computer Aided Verification","author":"S Almagor","year":"2017","unstructured":"Almagor, S., Kupferman, O., Ringert, J., Velner, Y.: Quantitative assume guarantee synthesis. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10427, pp. 353\u2013374. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-63390-9_19"},{"issue":"3\u20134","key":"13_CR2","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s00236-013-0191-5","volume":"51","author":"R Bloem","year":"2014","unstructured":"Bloem, R., et al.: Synthesizing robust systems. Acta Informatika 51(3\u20134), 193\u2013220 (2014)","journal-title":"Acta Informatika"},{"key":"13_CR3","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., 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). \n                      https:\/\/doi.org\/10.1007\/978-3-642-02658-4_14"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Bloem, R., Ehlers, R., Jacobs, S., K\u00f6nighofer, R.: How to handle assumptions in synthesis. In: SYNT 2014, Vienna, Austria, pp. 34\u201350 (2014)","DOI":"10.4204\/EPTCS.157.7"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/978-3-319-24953-7_29","volume-title":"Automated Technology for Verification and Analysis","author":"R Bloem","year":"2015","unstructured":"Bloem, R., Ehlers, R., K\u00f6nighofer, R.: Cooperative reactive synthesis. In: Finkbeiner, B., Pu, G., Zhang, L. (eds.) ATVA 2015. LNCS, vol. 9364, pp. 394\u2013410. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-24953-7_29"},{"issue":"3","key":"13_CR6","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., Sahar, Y.: Synthesis of reactive(1) designs. J. Comput. Syst. Sci. 78(3), 911\u2013938 (2012)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s00236-016-0273-2","volume":"54","author":"R Brenguier","year":"2017","unstructured":"Brenguier, R., Raskin, J.-F., Sankur, O.: Assume-admissible synthesis. Acta Informatica 54(1), 41\u201383 (2017)","journal-title":"Acta Informatica"},{"issue":"1\u20132","key":"13_CR8","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0304-3975(96)00228-9","volume":"178","author":"A Browne","year":"1997","unstructured":"Browne, A., Clarke, E., Jha, S., Long, D., Marrero, W.: An improved algorithm for the evaluation of fixpoint expressions. Theoret. Comput. Sci. 178(1\u20132), 237\u2013255 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR9","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). \n                      https:\/\/doi.org\/10.1007\/978-3-540-71209-1_21"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-642-15375-4_20","volume-title":"CONCUR 2010 - Concurrency Theory","author":"K Chatterjee","year":"2010","unstructured":"Chatterjee, K., Horn, F., L\u00f6ding, C.: Obliging games. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 284\u2013296. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-15375-4_20"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"D\u2019Ippolito, N., Braberman, V., Piterman, N., Uchitel, S.: Synthesis of live behavior models. In: 18th International Symposium on Foundations of Software Engineering, pp. 77\u201386. ACM (2010)","DOI":"10.1145\/1882291.1882305"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Ehlers, R., K\u00f6nighofer, R., Bloem, R.: Synthesizing cooperative reactive mission plans. In: IROS, pp. 3478\u20133485 (2015)","DOI":"10.1109\/IROS.2015.7353862"},{"issue":"2","key":"13_CR13","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10626-015-0223-0","volume":"27","author":"R Ehlers","year":"2017","unstructured":"Ehlers, R., Lafortune, S., Tripakis, S., Vardi, M.Y.: Supervisory control and reactive synthesis: a comparative introduction. Discrete Event Dyn. Syst. 27(2), 209\u2013260 (2017)","journal-title":"Discrete Event Dyn. Syst."},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-319-41540-6_18","volume-title":"Computer Aided Verification","author":"R Ehlers","year":"2016","unstructured":"Ehlers, R., Raman, V.: Slugs: extensible GR(1) synthesis. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9780, pp. 333\u2013339. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-41540-6_18"},{"key":"13_CR15","unstructured":"Emerson, E., Jutla, C.: Tree automata, mu-calculus and determinacy. In: FOCS 1991, pp. 368\u2013377, October 1991"},{"key":"13_CR16","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). \n                      https:\/\/doi.org\/10.1007\/978-3-642-12002-2_16"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1002\/rob.21695","volume":"34","author":"B Johnson","year":"2017","unstructured":"Johnson, B., Havlak, F., Kress-Gazit, H., Campbell, M.: Experimental evaluation and formal analysis of high-level tasks with dynamic obstacle anticipation on a full-sized autonomous vehicle. J. Field Robot. 34, 897\u2013911 (2017)","journal-title":"J. Field Robot."},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-642-19583-9_16","volume-title":"Hardware and Software: Verification and Testing","author":"U Klein","year":"2011","unstructured":"Klein, U., Pnueli, A.: Revisiting synthesis of GR(1) specifications. In: Barner, S., Harris, I., Kroening, D., Raz, O. (eds.) HVC 2010. LNCS, vol. 6504, pp. 161\u2013181. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-19583-9_16"},{"issue":"3","key":"13_CR19","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 \n                      \n                        \n                      \n                      $$\\mu $$\n                    -calculus. Theoret. Comput. Sci. 27(3), 333\u2013354 (1983)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"13_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10472-016-9508-8","volume":"78","author":"O Kupferman","year":"2016","unstructured":"Kupferman, O., Perelli, G., Vardi, M.: Synthesis with rational environments. Ann. Math. Artif. Intell. 78(1), 3\u201320 (2016)","journal-title":"Ann. Math. Artif. Intell."},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Majumdar, R., Piterman, N., Schmuck, A.-K.: Environmentally-friendly GR(1) synthesis (extended version). arXiv preprint (2019)","DOI":"10.1007\/978-3-030-17465-1_13"},{"key":"13_CR22","unstructured":"Moor, T.: Supervisory control on non-terminating processes: an interpretation of liveness properties. Technical report, Lehrstuhl f\u00fcr Regelungstechnik, Friedrich-Alexander Universit\u00e4t Erlangen-N\u00fcrnberg (2017)"},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1109\/9.8645","volume":"34","author":"PJ Ramadge","year":"1989","unstructured":"Ramadge, P.J.: Some tractable supervisory control problems for discrete-event systems modeled by B\u00fcchi automata. IEEE Trans. Autom. Control 34, 10\u201319 (1989)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"10","key":"13_CR24","first-page":"665","volume":"11","author":"R Rogersten","year":"2014","unstructured":"Rogersten, R., Xu, H., Ozay, N., Topcu, U., Murray, R.M.: Control software synthesis and validation for a vehicular electric power distribution testbed. J. Aerosp. Inf. Syst. 11(10), 665\u2013678 (2014)","journal-title":"J. Aerosp. Inf. Syst."},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Schmuck, A.-K., Moor, T., Majumdar, R.: On the relation between reactive synthesis and supervisory control of non-terminating processes. In: WODES 2018 (2018)","DOI":"10.1016\/j.ifacol.2018.06.275"},{"issue":"6","key":"13_CR26","doi-asserted-by":"publisher","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. Process. Lett. 59(6), 303\u2013308 (1996)","journal-title":"Inf. Process. Lett."},{"key":"13_CR27","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1137\/S0363012991217524","volume":"32","author":"JG Thistle","year":"1994","unstructured":"Thistle, J.G., Wonham, W.M.: Supervision of infinite behavior of discrete event systems. SIAM J. Control Optim. 32, 1098\u20131113 (1994)","journal-title":"SIAM J. Control Optim."},{"issue":"2","key":"13_CR28","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1109\/TCNS.2015.2401174","volume":"2","author":"H Xu","year":"2015","unstructured":"Xu, H., Topcu, U., Murray, R.M.: Specification and synthesis of reactive protocols for aircraft electric power distribution. IEEE Trans. Control Netw. Syst. 2(2), 193\u2013203 (2015)","journal-title":"IEEE Trans. Control Netw. Syst."}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17465-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:51:54Z","timestamp":1558345914000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-17465-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030174644","9783030174651"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17465-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TACAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2019\/tacas","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"164","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"42","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"13","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"12 full papers and 11 short papers accepted for TOOLympics and SV-COMP (avg. 4 reviewers\/paper, selected from 43 submissions)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}