{"type":"ScholarlyArticle","title":"Assume-Guarantee Synthesis for Prompt Linear Temporal Logic","authors":[{"name":"Nathanaël Fijalkow","slug":"nathanael-fijalkow","given":"Nathanaël","family":"Fijalkow","affiliation":"CNRS & LaBRI , Bordeaux , France; The Alan Turing Institute of data science , London , United Kingdom"},{"name":"Bastien Maubert","slug":"bastien-maubert","given":"Bastien","family":"Maubert","affiliation":"Università degli Studi di Napoli \"Federico II\" , Naples , Italy"},{"name":"Aniello Murano","slug":"aniello-murano","given":"Aniello","family":"Murano","affiliation":"Università degli Studi di Napoli \"Federico II\" , Naples , Italy"},{"name":"Moshe Vardi","slug":"moshe-vardi","given":"Moshe","family":"Vardi","affiliation":"Rice University , Houston , U.S."}],"abstract":"Prompt-LTL extends Linear Temporal Logic with a bounded version of the ``eventually'' operator to express temporal requirements such as bounding waiting times.  We study assume-guarantee synthesis for prompt-LTL: the goal is to construct a system such that for all environments satisfying a first prompt-LTL formula (the assumption) the system composed with this environment satisfies a second prompt-LTL formula (the guarantee).  This problem has been open for a decade. We construct an algorithm for solving it and show that, like classical LTL synthesis, it is 2-EXPTIME-complete.","doi":"10.24963/ijcai.2020/17","url":"https://ijcai.org/proceedings/2020/17","pdf":"https://ijcai.org/proceedings/2020/0017.pdf","markdown":"https://ijcai.org/proceedings/2020/17.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/17","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Agent-based and Multi-agent Systems","track":"Main track","number":17,"pages":{"first":117,"last":123},"keywords":["Agent-based and Multi-agent Systems: Formal Verification, Validation and Synthesis","Agent-based and Multi-agent Systems: Algorithmic Game Theory"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/24823/file_24823.m3u8","length_sec":300,"provider":"hls"}],"references":[{"position":1,"raw":"[Almagor et al., 2017] Shaull Almagor, Orna Kupferman, Jan Oliver Ringert, and Yaron Velner. Quantitative assume guarantee synthesis. In CAV, pages 353-374, 2017.","title":"Quantitative assume guarantee synthesis","authors":"Shaull Almagor, Orna Kupferman, Jan Oliver Ringert, Yaron Velner","year":"2017","venue":"CAV","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Alur and Henzinger, 1999] Rajeev Alur and Thomas A Henzinger. Reactive modules. Formal methods in system design, 15(1):7-48, 1999.","title":"Reactive modules","authors":"Rajeev Alur, Thomas A Henzinger","year":"1999","venue":"Formal methods in system design","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Alur et al., 2001] Rajeev Alur, Kousha Etessami, Salvatore La Torre, and Doron Peled. Parametric temporal logic for \"model measuring\". ACM Transactions on Computational Logic (ToCL), 2(3):388-407, 2001.","title":"Parametric temporal logic for \"model measuring","authors":"Rajeev Alur, Kousha Etessami, Salvatore La Torre, Doron Peled","year":"2001","venue":"ACM Transactions on Computational Logic (ToCL)","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Aminof et al., 2016] Benjamin Aminof, Aniello Murano, Sasha Rubin, and Florian Zuleger. Prompt alternating-time epistemic logics. KR, 16:258-267, 2016.","title":"Prompt alternating-time epistemic logics","authors":"Benjamin Aminof, Aniello Murano, Sasha Rubin, Florian Zuleger","year":"2016","venue":"KR","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bala, 2004] Sebastian Bala. Regular language matching and other decidable cases of the satisfiability problem for con- straints between regular open terms. In STACS, pages 596- 607, 2004.","title":"Regular language matching and other decidable cases of the satisfiability problem for constraints between regular open terms","authors":"Sebastian Bala","year":"2004","venue":"STACS","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bloem et al., 2015] Roderick Bloem, Rüdiger Ehlers, and Robert Könighofer. Cooperative reactive synthesis. In ATVA, pages 394-410, 2015.","title":"Cooperative reactive synthesis","authors":"Roderick Bloem, Rüdiger Ehlers, Robert Könighofer","year":"2015","venue":"ATVA","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Brenguier et al., 2017] Romain Brenguier, Jean-Franc ¸ois Raskin, and Ocan Sankur. Assume-admissible synthesis. Acta Informatica, 54(1):41-83, 2017.","title":"Assume-admissible synthesis","authors":"Romain Brenguier, Jean-Franc ¸ois Raskin, Ocan Sankur","year":"2017","venue":"Acta Informatica","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Chatterjee and Henzinger, 2007] Krishnendu Chatterjee and Thomas A Henzinger. Assume-guarantee synthesis. In TACAS, pages 261-275, 2007.","title":"Assume-guarantee synthesis","authors":"Krishnendu Chatterjee, Thomas A Henzinger","year":"2007","venue":"TACAS","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Colcombet and Fijalkow, 2016] Thomas Colcombet and Nathanaël Fijalkow. The bridge between regular cost functions and omega-regular languages. In ICALP, pages 126:1-126:13, 2016.","title":"Thomas Colcombet and Nathanaël Fijalkow. The bridge between regular cost functions and omega-regular languages","authors":"Fijalkow Colcombet","year":"2016","venue":"ICALP","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Colcombet and Göller, 2016] Thomas Colcombet and Ste- fan Göller. Games with bound guess actions. In LICS, pages 257-266, 2016.","title":"Games with bound guess actions","authors":"Thomas Colcombet, Stefan Göller","year":"2016","venue":"LICS","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Colcombet et al., 2010] Thomas Colcombet, Denis Kuper- berg, and Sylvain Lombardy. Regular temporal cost func- tions. In ICALP, pages 563-574, 2010.","title":"Regular temporal cost functions","authors":"Thomas Colcombet, Denis Kuperberg, Sylvain Lombardy","year":"2010","venue":"ICALP","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Colcombet, 2009] Thomas Colcombet. The theory of sta- bilisation monoids and regular cost functions. In ICALP, pages 139-150, 2009.","title":"The theory of stabilisation monoids and regular cost functions","authors":"Thomas Colcombet","year":"2009","venue":"ICALP","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Colcombet, 2013a] Thomas Colcombet. Fonctions régulières de coût. Habilitation Thesis, 2013.","title":"Thomas Colcombet. Fonctions régulières de coût","authors":"Colcombet","year":"2013","venue":null,"doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Colcombet, 2013b] Thomas Colcombet. Regular cost func- tions, part I: logic and algebra over words. Logical Meth- ods in Computer Science, 9(3), 2013.","title":"Thomas Colcombet. Regular cost functions, part I: logic and algebra over words","authors":"Colcombet","year":"2013","venue":"Logical Methods in Computer Science","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Fijalkow et al., 2018] Nathanaël Fijalkow, Bastien Maubert, Aniello Murano, and Sasha Rubin. Quan- tifying bounds in strategy logic. In CSL, 2018.","title":"Quantifying bounds in strategy logic","authors":"Nathanaël Fijalkow, Bastien Maubert, Aniello Murano, Sasha Rubin","year":"2018","venue":"CSL","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Filiot et al., 2018] Emmanuel Filiot, Raffaella Gentilini, and Jean-Franc ¸ois Raskin. Rational synthesis under im- perfect information. In LICS, pages 422-431, 2018.","title":"Rational synthesis under imperfect information","authors":"Emmanuel Filiot, Raffaella Gentilini, Jean-Franc ¸ois Raskin","year":"2018","venue":"LICS","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Fisman et al., 2010] Dana Fisman, Orna Kupferman, and Yoad Lustig. Rational synthesis. In TACAS, pages 190- 204, 2010.","title":"Rational synthesis","authors":"Dana Fisman, Orna Kupferman, Yoad Lustig","year":"2010","venue":"TACAS","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Henzinger and Piterman, 2006] Thomas A. Henzinger and Nir Piterman. Solving games without determinization. In CSL, pages 395-410, 2006.","title":"Solving games without determinization","authors":"Thomas A Henzinger, Nir Piterman","year":"2006","venue":"CSL","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Jacobs and Bloem, 2018] Swen Jacobs and Roder- ick Bloem. The 5th reactive synthesis compe- tition (SYNTCOMP). http://www.syntcomp.org/ syntcomp-2018-results, 2018.","title":"The 5th reactive synthesis competition (SYNTCOMP)","authors":"Bloem Jacobs, Swen Jacobs, Roderick Bloem","year":"2018","venue":null,"doi":null,"url":"http://www.syntcomp.org/syntcomp-2018-results,2018","internal_url":null},{"position":20,"raw":"[Jacobs et al., 2018] Swen Jacobs, Leander Tentrup, and Martin Zimmermann. Distributed synthesis for parame- terized temporal logics. Information and Computation, 262:311-328, 2018.","title":"Distributed synthesis for parameterized temporal logics","authors":"Swen Jacobs, Leander Tentrup, Martin Zimmermann","year":"2018","venue":"Information and Computation","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Jacobs et al., 2019] Swen Jacobs, Guillermo A. Pérez, and Roderick Bloem. The 6th reactive synthesis competition (SYNTCOMP). http://www.syntcomp.org/ syntcomp-2019-results/, 2019.","title":"The 6th reactive synthesis competition","authors":"Swen Jacobs, Guillermo A Pérez, Roderick Bloem","year":null,"venue":null,"doi":null,"url":"http://www.syntcomp.org/syntcomp-2019-results/,2019","internal_url":null},{"position":22,"raw":"[Kirsten, 2004] Daniel Kirsten. Desert automata and the finite substitution problem. In STACS, pages 305-316, 2004.","title":"Desert automata and the finite substitution problem","authors":"Kirsten Daniel","year":"2004","venue":"STACS","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Kuperberg and Vanden Boom, 2012] Denis Kuperberg and Michael Vanden Boom. On the expressive power of cost logics over infinite words. In ICALP, pages 287-298, 2012.","title":"On the expressive power of cost logics over infinite words","authors":"Vanden Kuperberg, Denis Boom, Michael Kuperberg, Boom Vanden","year":"2012","venue":"ICALP","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Kuperberg, 2014] Denis Kuperberg. Linear temporal logic for regular cost functions. Logical Methods in Computer Science, 10(1), 2014.","title":"Linear temporal logic for regular cost functions","authors":"Denis Kuperberg","year":"2014","venue":"Logical Methods in Computer Science","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Kupferman et al., 2009] Orna Kupferman, Nir Piterman, and Moshe Y Vardi. From liveness to promptness. For- mal Methods in System Design, 34(2):83-103, 2009.","title":"From liveness to promptness","authors":"Orna Kupferman, Nir Piterman, Moshe Y Vardi","year":"2009","venue":"Formal Methods in System Design","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Kupferman et al., 2016] Orna Kupferman, Giuseppe Perelli, and Moshe Y. Vardi. Synthesis with rational environments. Annals of Mathematics and Artificial Intelligence, 78(1):3-20, 2016.","title":"Synthesis with rational environments","authors":"Orna Kupferman, Giuseppe Perelli, Moshe Y Vardi","year":"2016","venue":"Annals of Mathematics and Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Kwiatkowska et al., 2010] Marta Kwiatkowska, Gethin Norman, David Parker, and Hongyang Qu. Assume- guarantee verification for probabilistic systems. In TACAS, pages 23-37, 2010.","title":"Assumeguarantee verification for probabilistic systems","authors":"Marta Kwiatkowska, Gethin Norman, David Parker, Hongyang Qu","year":"2010","venue":"TACAS","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Maoz and Sa'ar, 2012] Shahar Maoz and Yaniv Sa'ar. Assume-guarantee scenarios: Semantics and synthesis. In MoDELS, pages 335-351, 2012.","title":"Assume-guarantee scenarios: Semantics and synthesis","authors":"Sa Maoz, Shahar Maoz, Yaniv Sa, ' Ar","year":"2012","venue":"MoDELS","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Pnueli and Rosner, 1989] Amir Pnueli and Roni Rosner. On the synthesis of a reactive module. In POPL, pages 179- 190, 1989.","title":"On the synthesis of a reactive module","authors":"Rosner Pnueli, Amir Pnueli, Roni Rosner","year":"1989","venue":"POPL","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Pnueli, 1977] Amir Pnueli. The temporal logic of programs. In FOCS, pages 46-57, 1977.","title":"The temporal logic of programs","authors":"Amir Pnueli, Pnueli","year":"1977","venue":"FOCS","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Pnueli, 1985] Amir Pnueli. In transition from global to modular temporal reasoning about programs. In Log- ics and models of concurrent systems, pages 123-144. Springer, 1985.","title":"In transition from global to modular temporal reasoning about programs","authors":"Amir Pnueli, Pnueli","year":"1985","venue":"Logics and models of concurrent systems","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Vardi, 1995] Moshe Y. Vardi. An automata-theoretic ap- proach to fair realizability and synthesis. In CAV, pages 267-278, 1995.","title":"An automata-theoretic approach to fair realizability and synthesis","authors":"Moshe Y Vardi","year":"1995","venue":"CAV","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}