{"type":"ScholarlyArticle","title":"LTL Realizability via Safety and Reachability Games","authors":[{"name":"Alberto Camacho","slug":"alberto-camacho","given":"Alberto","family":"Camacho","affiliation":"Chilean Center for Semantic Web Research; CSAIL , Massachusetts Institute of Technology."},{"name":"Christian Muise","slug":"christian-muise","given":"Christian","family":"Muise","affiliation":"Chilean Center for Semantic Web Research"},{"name":"Jorge A. Baier","slug":"jorge-a-baier","given":"Jorge A.","family":"Baier","affiliation":"‡ Department of Computer Science , University of Toronto IBM Research , Cambridge Research Center , USA; ‡ Pontificia Universidad Católica de Chile"},{"name":"Sheila A. McIlraith","slug":"sheila-a-mcilraith","given":"Sheila A.","family":"McIlraith","affiliation":"Chilean Center for Semantic Web Research"}],"abstract":"In this paper, we address the problem of LTL realizability and synthesis. State of the art techniques rely on so-called bounded synthesis methods, which reduce the problem to a safety game. Realizability is determined by solving synthesis in a dual game. We provide a unified view of duality, and introduce novel bounded realizability methods via reductions to reachability games. Further, we introduce algorithms, based on AI automated planning, to solve these safety and reachability games. This is the the first complete approach to LTL realizability and synthesis via automated planning. Experiments illustrate that reductions to reachability games are an alternative to reductions to safety games, and show that planning can be a competitive approach to LTL realizability and synthesis.","doi":"10.24963/ijcai.2018/651","url":"https://ijcai.org/proceedings/2018/651","pdf":"https://ijcai.org/proceedings/2018/0651.pdf","markdown":"https://ijcai.org/proceedings/2018/651.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/651","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Planning and Scheduling","track":"Main track","number":651,"pages":{"first":4683,"last":4691},"keywords":["Planning and Scheduling: Planning and Scheduling","Planning and Scheduling: Planning under Uncertainty","Agent-based and Multi-agent Systems: Formal Verification, Validation and Synthesis","Planning and Scheduling: Applications of Planning"],"videos":[],"references":[{"position":1,"raw":"[Aguas et al., 2016] Javier Segovia Aguas, Sergio Jiménez Celorrio, and Anders Jonsson. Generalized planning with procedural domain control knowledge. In ICAPS, pages 285-293, 2016.","title":"Generalized planning with procedural domain control knowledge","authors":"Javier Segovia Aguas, Sergio Jiménez Celorrio, Anders Jonsson","year":"2016","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Almagor and Kupferman, 2016] Shaull Almagor and Orna Kupferman. High-quality synthesis against stochastic en- vironments. In CSL, pages 28:1-28:17, 2016.","title":"High-quality synthesis against stochastic environments","authors":"Kupferman Almagor, Shaull Almagor, Orna Kupferman","year":"2016","venue":"CSL","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Baier and McIlraith, 2006] Jorge A. Baier and Sheila A. McIlraith. Planning with temporally extended goals using heuristic search. In ICAPS, pages 342-345, 2006.","title":"Planning with temporally extended goals using heuristic search","authors":"Jorge A Baier, Sheila A Mcilraith","year":"2006","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bohy et al., 2012] Aaron Bohy, Véronique Bruyère, Em- manuel Filiot, Naiyong Jin, and Jean-Franc ¸ois Raskin. Acacia+, a tool for LTL synthesis. In CAV, 2012.","title":"Acacia+, a tool for LTL synthesis","authors":"Aaron Bohy, Véronique Bruyère, Emmanuel Filiot, Naiyong Jin, Jean-Franc ¸ois Raskin","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bonet et al., 2017] Blai Bonet, Giuseppe De Giacomo, Hec- tor Geffner, and Sasha Rubin. Generalized planning: Non- deterministic abstractions and trajectory constraints. In IJ- CAI, pages 873-879, 2017.","title":"Generalized planning: Nondeterministic abstractions and trajectory constraints","authors":"Blai Bonet, Giuseppe De Giacomo, Hector Geffner, Sasha Rubin","year":"2017","venue":"IJ-CAI","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Camacho et al., 2017] Alberto Camacho, Eleni Triantafil- lou, Christian J. Muise, Jorge A. Baier, and Sheila A. McIlraith. Non-deterministic planning with temporally ex- tended goals: LTL over finite and infinite traces. In AAAI, pages 3716-3724, 2017.","title":"Non-deterministic planning with temporally extended goals: LTL over finite and infinite traces","authors":"Alberto Camacho, Eleni Triantafillou, Christian J Muise, Jorge A Baier, Sheila A Mcilraith","year":"2017","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Camacho et al., 2018a] Alberto Camacho, Jorge A. Baier, Christian J. Muise, and Sheila A. McIlraith. Finite LTL synthesis as planning. In ICAPS, 2018. To appear.","title":"Finite LTL synthesis as planning","authors":"Camacho","year":"2018","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Camacho et al., 2018b] Alberto Camacho, Jorge A. Baier, Christian J. Muise, and Sheila A. McIlraith. Synthesizing controllers: On the correspondence between LTL synthe- sis and non-deterministic planning. In Advances in Artifi- cial Intelligence -Proceedings of the 31st Canadian Con- ference on Artificial Intelligence, pages 45-59, 2018.","title":"Synthesizing controllers: On the correspondence between LTL synthesis and non-deterministic planning","authors":"Camacho","year":"2018","venue":"Advances in Artificial Intelligence -Proceedings of the 31st Canadian Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Camacho et al., 2018c] Alberto Camacho, Christian J. Muise, Jorge A. Baier, and Sheila A. McIlraith. SynKit: LTL synthesis as a service. In IJCAI, 2018. To appear.","title":"SynKit: LTL synthesis as a service","authors":"Camacho","year":"2018","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2018/848"},{"position":10,"raw":"[Cimatti et al., 2003] Alessandro Cimatti, Marco Pistore, Marco Roveri, and Paolo Traverso. Weak, strong, and strong cyclic planning via symbolic model checking. Arti- ficial Intelligence, 147(1-2):35-84, 2003.","title":"Weak, strong, and strong cyclic planning via symbolic model checking","authors":"Alessandro Cimatti, Marco Pistore, Marco Roveri, Paolo Traverso","year":"2003","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[De Giacomo and Vardi, 2015] Giuseppe De Giacomo and Moshe Y. Vardi. Synthesis for LTL and LDL on finite traces. In IJCAI, pages 1558-1564, 2015.","title":"Synthesis for LTL and LDL on finite traces","authors":"De Giacomo, Giuseppe De Vardi, Moshe Y Giacomo, Vardi","year":"2015","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2015/223"},{"position":12,"raw":"[Duret-Lutz et al., 2016] Alexandre Duret-Lutz, Alexandre Lewkowicz, Amaury Fauchille, Thibaud Michaud, Eti- enne Renault, and Laurent Xu. Spot 2.0 -A framework for LTL ω-automata manipulation. In ATVA, pages 122- 129, 2016.","title":"Spot 2.0 -A framework for LTL ω-automata manipulation","authors":"Alexandre Duret-Lutz, Alexandre Lewkowicz, Amaury Fauchille, Thibaud Michaud, Etienne Renault, Laurent Xu","year":"2016","venue":"ATVA","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Ehlers, 2010] Rüdiger Ehlers. Symbolic bounded synthesis. In CAV, volume 6174, pages 365-379. Springer, 2010.","title":"Symbolic bounded synthesis","authors":"Rüdiger Ehlers","year":"2010","venue":"CAV","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Ehlers, 2011] Rüdiger Ehlers. Experimental aspects of syn- thesis. In IWIGP, pages 1-16, 2011.","title":"Experimental aspects of synthesis","authors":"Rüdiger Ehlers","year":"2011","venue":"IWIGP","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Filiot et al., 2009] Emmanuel Filiot, Naiyong Jin, and Jean- Franc ¸ois Raskin. An antichain algorithm for LTL realiz- ability. In CAV, pages 263-277, 2009.","title":"An antichain algorithm for LTL realizability","authors":"Emmanuel Filiot, Naiyong Jin, Jean-Franc ¸ois Raskin","year":"2009","venue":"CAV","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Geffner and Bonet, 2013] Hector Geffner and Blai Bonet. A Concise Introduction to Models and Methods for Auto- mated Planning. Synthesis Lectures on Artificial Intelli- gence and Machine Learning, 7(2):1-141, 2013.","title":"A Concise Introduction to Models and Methods for Automated Planning","authors":"Bonet Geffner, Hector Geffner, Blai Bonet","year":"2013","venue":"Synthesis Lectures on Artificial Intelligence and Machine Learning","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Jacobs et al., 2016] Swen Jacobs, Felix Klein, and Sebas- tian Schirmer. A high-level LTL synthesis format: TLSF v1.1. In SYNT, pages 112-132, 2016.","title":"A high-level LTL synthesis format: TLSF v1.1","authors":"Swen Jacobs, Felix Klein, Sebastian Schirmer","year":"2016","venue":"SYNT","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Jacobs et al., 2017] Swen Jacobs, Nicolas Basset, Roder- ick Bloem, Romain Brenguier, Maximilien Colange, Pe- ter Faymonville, Bernd Finkbeiner, Ayrat Khalimov, Fe- lix Klein, Thibaud Michaud, Guillermo A. Pérez, Jean- Franc ¸ois Raskin, Ocan Sankur, and Leander Tentrup. The 4th reactive synthesis competition (SYNTCOMP 2017): Benchmarks, participants & results. In SYNT, pages 116- 143, 2017.","title":"The 4th reactive synthesis competition (SYNTCOMP 2017): Benchmarks, participants & results","authors":"Swen Jacobs, Nicolas Basset, Roderick Bloem, Romain Brenguier, Maximilien Colange, Peter Faymonville, Bernd Finkbeiner, Ayrat Khalimov, Felix Klein, Thibaud Michaud, Guillermo A Pérez, Jean-Franc ¸ois Raskin, Ocan Sankur, Leander Tentrup","year":"2017","venue":"SYNT","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Jobstmann and Bloem, 2006] Barbara Jobstmann and Rod- erick Bloem. Optimizations for LTL synthesis. In FM- CAD, pages 117-124, 2006.","title":"Barbara Jobstmann and Roderick Bloem. Optimizations for LTL synthesis","authors":"Bloem Jobstmann","year":"2006","venue":"FM-CAD","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Khalimov et al., 2013] Ayrat Khalimov, Swen Jacobs, and Roderick Bloem. PARTY parameterized synthesis of to- ken rings. In CAV, pages 928-933. Springer, 2013.","title":"PARTY parameterized synthesis of token rings","authors":"Khalimov","year":"2013","venue":"CAV","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Kupferman and Vardi, 2001] Orna Kupferman and Moshe Y. Vardi. Model checking of safety proper- ties. Formal Methods in System Design, 19(3):291-314, 2001.","title":"Model checking of safety properties","authors":"Vardi ; ] Orna Kupferman, Moshe Y Kupferman, Vardi","year":"2001","venue":"Formal Methods in System Design","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Kupferman and Vardi, 2005] Orna Kupferman and Moshe Y. Vardi. Safraless decision procedures. In FOCS, pages 531-542, 2005.","title":"Safraless decision procedures","authors":"Vardi Kupferman, Orna Kupferman, Moshe Y Vardi","year":"2005","venue":"FOCS","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Kupferman, 2006] Orna Kupferman. Avoiding determiniza- tion. In LICS, pages 243-254, 2006.","title":"Avoiding determinization","authors":"Orna Kupferman, Kupferman","year":"2006","venue":"LICS","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Mattmüller et al., 2010] Robert Mattmüller, Manuela Or- tlieb, Malte Helmert, and Pascal Bercher. Pattern database heuristics for fully observable nondeterministic planning. In ICAPS, pages 105-112, 2010.","title":"Pattern database heuristics for fully observable nondeterministic planning","authors":"Robert Mattmüller, Manuela Ortlieb, Malte Helmert, Pascal Bercher","year":"2010","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Muise et al., 2012] Christian Muise, Sheila A. McIlraith, and J. Christopher Beck. Improved Non-deterministic Planning by Exploiting State Relevance. In ICAPS, 2012.","title":"Improved Non-deterministic Planning by Exploiting State Relevance","authors":"Christian Muise, Sheila A Mcilraith, J Christopher Beck","year":"2012","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Patrizi et al., 2013] Fabio Patrizi, Nir Lipovetzky, and Hec- tor Geffner. Fair LTL synthesis for non-deterministic sys- tems using strong cyclic planners. In IJCAI, 2013.","title":"Fair LTL synthesis for non-deterministic systems using strong cyclic planners","authors":"Fabio Patrizi, Nir Lipovetzky, Hector Geffner","year":"2013","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2013/345"},{"position":27,"raw":"[Pnueli and Rosner, 1989] Amir Pnueli and Roni Rosner. On the synthesis of a reactive module. In Conference Record of POPL, pages 179-190, 1989.","title":"On the synthesis of a reactive module","authors":"Rosner Pnueli, Amir Pnueli, Roni Rosner","year":"1989","venue":"Conference Record of POPL","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Rintanen, 2004] Jussi Rintanen. Complexity of planning with partial observability. In ICAPS, pages 345-354, 2004.","title":"Jussi Rintanen. Complexity of planning with partial observability","authors":"Rintanen","year":"2004","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Schewe and Finkbeiner, 2007] Sven Schewe and Bernd Finkbeiner. Bounded synthesis. In ATVA, pages 474-488, 2007.","title":"Bounded synthesis","authors":"Finkbeiner Schewe, Sven Schewe, Bernd Finkbeiner","year":"2007","venue":"ATVA","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Sistla, 1994] A Prasad Sistla. Safety, liveness and fairness in temporal logic. Formal Aspects of Computing, 6(5):495- 511, 1994.","title":"Safety, liveness and fairness in temporal logic","authors":"Sistla Prasad","year":"1994","venue":"Formal Aspects of Computing","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Thomas, 1995] Wolfgang Thomas. On the synthesis of strategies in infinite games. In STACS, pages 1-13. Springer, 1995.","title":"On the synthesis of strategies in infinite games","authors":"Wolfgang Thomas, Thomas","year":"1995","venue":"STACS","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}