{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:15:17Z","timestamp":1742980517020,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031432637"},{"type":"electronic","value":"9783031432644"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43264-4_17","type":"book-chapter","created":{"date-parts":[[2023,9,6]],"date-time":"2023-09-06T23:03:02Z","timestamp":1694041382000},"page":"263-279","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["$${\\textsc {ltl}}_f$$ Synthesis Under Environment Specifications for\u00a0Reachability and\u00a0Safety Properties"],"prefix":"10.1007","author":[{"given":"Benjamin","family":"Aminof","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"De Giacomo","sequence":"additional","affiliation":[]},{"given":"Antonio","family":"Di Stasio","sequence":"additional","affiliation":[]},{"given":"Hugo","family":"Francon","sequence":"additional","affiliation":[]},{"given":"Sasha","family":"Rubin","sequence":"additional","affiliation":[]},{"given":"Shufang","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,7]]},"reference":[{"key":"17_CR1","unstructured":"Aminof, B., De Giacomo, G., Murano, A., Rubin, S.: Planning and synthesis under assumptions. CoRR (2018)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Aminof, B., De Giacomo, G., Murano, A., Rubin, S.: Planning under LTL environment specifications. In: ICAPS, pp. 31\u201339 (2019)","DOI":"10.1609\/icaps.v29i1.3457"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Aminof, B., De Giacomo, G., Lomuscio, A., Murano, A., Rubin, S.: Synthesizing best-effort strategies under multiple environment specifications. In: KR, pp. 42\u201351 (2021)","DOI":"10.24963\/kr.2021\/5"},{"key":"17_CR4","unstructured":"Aminof, B., De Giacomo, G., Murano, A., Rubin, S.: Synthesis under assumptions. In: KR, pp. 615\u2013616. AAAI Press (2018)"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Aminof, B., De Giacomo, G., Rubin, S.: Best-effort synthesis: doing your best is not harder than giving up. In: IJCAI, pp. 1766\u20131772. ijcai.org (2021)","DOI":"10.24963\/ijcai.2021\/243"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Aminof, B., De Giacomo, G., Rubin, S., Zuleger, F.: Stochastic best-effort strategies for Borel goals. In: LICS, pp. 1\u201313 (2023)","DOI":"10.1109\/LICS56636.2023.10175747"},{"issue":"3","key":"17_CR7","doi-asserted-by":"publisher","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. Inform. Appl. 36(3), 261\u2013275 (2002)","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"17_CR8","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). https:\/\/doi.org\/10.1007\/978-3-540-70918-3_17"},{"key":"17_CR9","unstructured":"Camacho, A., Bienvenu, M., McIlraith, S.A.: Finite LTL synthesis with environment assumptions and quality measures. In: KR, pp. 454\u2013463 (2018)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Camacho, A., Bienvenu, M., McIlraith, S.A.: Towards a unified view of AI planning and reactive synthesis. In: ICAPS, pp. 58\u201367 (2019)","DOI":"10.1609\/icaps.v29i1.3460"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"De Giacomo, G., Di Stasio, A., Fuggitti, F., Rubin, S.: Pure-past linear temporal and dynamic logic on finite traces. In: IJCAI, pp. 4959\u20134965 (2020)","DOI":"10.24963\/ijcai.2020\/690"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"De Giacomo, G., Di Stasio, A., Perelli, G., Zhu, S.: Synthesis with mandatory stop actions. In: KR, pp. 237\u2013246 (2021)","DOI":"10.24963\/kr.2021\/23"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"De Giacomo, G., Di Stasio, A., Tabajara, L.M., Vardi, M.Y., Zhu, S.: Finite-trace and generalized-reactivity specifications in temporal synthesis. In: IJCAI, pp. 1852\u20131858 (2021)","DOI":"10.24963\/ijcai.2021\/255"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"De Giacomo, G., Di Stasio, A., Vardi, M.Y., Zhu, S.: Two-stage technique for $$\\text{LTL}_f$$ synthesis under LTL assumptions. In: KR, pp. 304\u2013314 (2020)","DOI":"10.24963\/kr.2020\/31"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"De Giacomo, G., Rubin, S.: Automata-theoretic foundations of FOND planning for $$\\text{ LTL}_f$$ and $$\\text{ LDL}_f$$ goals. In: IJCAI, pp. 4729\u20134735 (2018)","DOI":"10.24963\/ijcai.2018\/657"},{"key":"17_CR16","unstructured":"De Giacomo, G., Vardi, M.Y.: Linear temporal logic and linear dynamic logic on finite traces. In: IJCAI, pp. 854\u2013860 (2013)"},{"key":"17_CR17","unstructured":"De Giacomo, G., Vardi, M.Y.: Synthesis for LTL and LDL on finite traces. In: IJCAI, pp. 1558\u20131564 (2015)"},{"key":"17_CR18","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). https:\/\/doi.org\/10.1007\/978-3-642-03816-7_27"},{"key":"17_CR19","unstructured":"Fijalkow, N., et al.: Games on graphs (2023)"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Geffner, H., Bonet, B.: A Coincise Introduction to Models and Methods for Automated Planning. Morgan & Claypool (2013)","DOI":"10.1007\/978-3-031-01564-9"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36387-4","volume-title":"Automata Logics, and Infinite Games: A Guide to Current Research","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata Logics, and Infinite Games: A Guide to Current Research. LNCS, vol. 2500. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36387-4"},{"issue":"3","key":"17_CR22","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1023\/A:1011254632723","volume":"19","author":"O Kupferman","year":"2001","unstructured":"Kupferman, O., Vardi, M.Y.: Model checking of safety properties. Formal Methods Syst. Des. 19(3), 291\u2013314 (2001)","journal-title":"Formal Methods Syst. Des."},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Manna, Z., Pnueli, A.: A hierarchy of temporal properties. In: PODC, pp. 377\u2013410 (1990)","DOI":"10.1145\/93385.93442"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: POPL, pp. 179\u2013190 (1989)","DOI":"10.1145\/75277.75293"},{"issue":"2","key":"17_CR25","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"MO Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.S.: Finite automata and their decision problems. IBM J. Res. Dev. 3(2), 114\u2013125 (1959)","journal-title":"IBM J. Res. Dev."},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"Tabajara, L.M., Vardi, M.Y.: LTLF synthesis under partial observability: from theory to practice. In: GandALF. EPTCS, vol. 326, pp. 1\u201317 (2020)","DOI":"10.4204\/EPTCS.326.1"},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"Tabajara, L.M., Vardi, M.Y.: Partitioning techniques in LTLF synthesis. In: IJCAI, pp. 5599\u20135606 (2019)","DOI":"10.24963\/ijcai.2019\/777"},{"key":"17_CR28","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/11591191_28","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"D Tabakov","year":"2005","unstructured":"Tabakov, D., Vardi, M.Y.: Experimental evaluation of classical automata constructions. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 396\u2013411. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11591191_28"},{"key":"17_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-642-23059-2_10","volume-title":"Business Process Management","author":"M Westergaard","year":"2011","unstructured":"Westergaard, M.: Better algorithms for analyzing and enacting declarative workflow languages using LTL. In: Rinderle-Ma, S., Toumani, F., Wolf, K. (eds.) BPM 2011. LNCS, vol. 6896, pp. 83\u201398. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23059-2_10"},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Zhu, S., De Giacomo, G., Pu, G., Vardi, M.Y.: $$\\text{ LTL}_f$$ synthesis with fairness and stability assumptions. In: AAAI, pp. 3088\u20133095 (2020)","DOI":"10.1609\/aaai.v34i03.5704"},{"key":"17_CR31","doi-asserted-by":"crossref","unstructured":"Zhu, S., Tabajara, L.M., Li, J., Pu, G., Vardi, M.Y.: Symbolic $$\\text{ LTL}_f$$ synthesis. In: IJCAI, pp. 1362\u20131369 (2017)","DOI":"10.24963\/ijcai.2017\/189"},{"key":"17_CR32","doi-asserted-by":"crossref","unstructured":"Zhu, S., Tabajara, L.M., Pu, G., Vardi, M.Y.: On the power of automata minimization in temporal synthesis. In: GandALF. EPTCS, vol. 346, pp. 117\u2013134 (2021)","DOI":"10.4204\/EPTCS.346.8"}],"container-title":["Lecture Notes in Computer Science","Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43264-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,27]],"date-time":"2024-10-27T16:20:20Z","timestamp":1730046020000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43264-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031432637","9783031432644"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43264-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"7 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUMAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Multi-Agent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Naples","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eumas2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/vadimmalvone.github.io\/eumas2023\/","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 (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51% - 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 (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"PhD - Short Papers (20 submissions; 16 short papers accepted for proceedings)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}