{"type":"ScholarlyArticle","title":"Synthesizing Good-Enough Strategies for LTLf Specifications","authors":[{"name":"Yong Li","slug":"yong-li","given":"Yong","family":"Li","affiliation":""},{"name":"Andrea Turrini","slug":"andrea-turrini","given":"Andrea","family":"Turrini","affiliation":""},{"name":"Moshe Y. Vardi","slug":"moshe-y-vardi","given":"Moshe Y.","family":"Vardi","affiliation":""},{"name":"Lijun Zhang","slug":"lijun-zhang","given":"Lijun","family":"Zhang","affiliation":""}],"abstract":"We consider the problem of synthesizing good-enough (GE)-strategies for linear temporal logic (LTL) over finite traces or LTLf for short.\r\nThe problem of synthesizing GE-strategies for an LTL formula φ over infinite traces reduces to the problem of synthesizing winning strategies for the formula (∃Oφ)⇒φ where O is the set of propositions controlled by the system.\r\nWe first prove that this reduction does not work for LTLf formulas.\r\nThen we show how to synthesize GE-strategies for LTLf formulas via the Good-Enough (GE)-synthesis of LTL formulas.\r\nUnfortunately, this requires to construct deterministic parity automata on infinite words, which is computationally expensive.\r\nWe then show how to synthesize GE-strategies for LTLf formulas by a reduction to solving games played on deterministic Büchi automata, based on an easier construction of deterministic automata on finite words.\r\nWe show empirically that our specialized synthesis algorithm for GE-strategies outperforms the algorithms going through GE-synthesis of LTL formulas by orders of magnitude.","doi":"10.24963/ijcai.2021/570","url":"https://ijcai.org/proceedings/2021/570","pdf":"https://ijcai.org/proceedings/2021/0570.pdf","markdown":"https://ijcai.org/proceedings/2021/570.md","bibtex":"https://ijcai.org/proceedings/2021/bibtex/570","volume":{"slug":"2021","title":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2021","url":"https://ijcai.org/proceedings/2021/","year":2021,"location":"Montreal","dates":"19-27 August 2021","editors":"Prof. Zhi-Hua Zhou","isbn":"978-0-9992411-9-6","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2021"},"section":"Planning and Scheduling","track":"Main Track","number":570,"pages":{"first":4144,"last":4151},"keywords":["Planning and Scheduling: Applications of Planning","Planning and Scheduling: Temporal and Hybrid Planning","Planning and Scheduling: Planning and Scheduling"],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}