{"type":"ScholarlyArticle","title":"Partitioning Techniques in LTLf Synthesis","authors":[{"name":"Lucas Martinelli Tabajara","slug":"lucas-martinelli-tabajara","given":"Lucas","family":"Martinelli Tabajara","affiliation":"Rice University"},{"name":"Moshe Y. Vardi","slug":"moshe-y-vardi","given":"Moshe Y.","family":"Vardi","affiliation":"Rice University"}],"abstract":"Decomposition is a general principle in computational thinking, aiming at decomposing a problem instance into easier subproblems. Indeed, decomposing a transition system into a partitioned transition relation was critical to scaling BDD-based model checking to large state spaces. Since then, it has become a standard technique for dealing with related problems, such as Boolean synthesis. More recently, partitioning has begun to be explored in the synthesis of reactive systems. LTLf synthesis, a finite-horizon version of reactive synthesis with applications in areas such as robotics, seems like a promising candidate for partitioning techniques. After all, the state of the art is based on a BDD-based symbolic algorithm similar to those from model checking, and partitioning could be a potential solution to the current bottleneck of this approach, which is the construction of the state space. In this work, however, we expose fundamental limitations of partitioning that hinder its effective application to symbolic LTLf synthesis. We not only provide evidence for this fact through an extensive experimental evaluation, but also perform an in-depth analysis to identify the reason for these results. We trace the issue to an overall increase in the size of the explored state space, caused by an inability of partitioning to fully exploit state-space minimization, which has a crucial effect on performance. We conclude that more specialized decomposition techniques are needed for LTLf synthesis which take into account the effects of minimization.","doi":"10.24963/ijcai.2019/777","url":"https://ijcai.org/proceedings/2019/777","pdf":"https://ijcai.org/proceedings/2019/0777.pdf","markdown":"https://ijcai.org/proceedings/2019/777.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/777","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Planning and Scheduling","track":"Main track","number":777,"pages":{"first":5599,"last":5606},"keywords":["Planning and Scheduling: Theoretical Foundations of Planning","Agent-based and Multi-agent Systems: Formal Verification, Validation and Synthesis"],"videos":[],"references":[{"position":1,"raw":"[Akshay et al., 2017] S. Akshay, Supratik Chakraborty, Ajith K. John, and Shetal Shah. Towards Parallel Boolean Functional Synthesis. In Tools and Algorithms for the Construction and Analysis of Systems -23rd International Conference, TACAS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Proceedings, Part I, pages 337-353, 2017.","title":"Towards Parallel Boolean Functional Synthesis","authors":"S Akshay, Supratik Chakraborty, Ajith K John, Shetal Shah","year":"2017","venue":"Tools and Algorithms for the Construction and Analysis of Systems -23rd International Conference, TACAS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Proceedings, Part I","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bouton, 1901] Charles L Bouton. Nim, a game with a complete mathematical theory. Annals of Mathematics, 3(1/4):35-39, 1901.","title":"Nim, a game with a complete mathematical theory","authors":"Charles L Bouton","year":"1901","venue":"Annals of Mathematics","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Burch et al., 1991] Jerry R. Burch, Edmund M. Clarke, and David E. Long. Representing Circuits More Efficiently in Symbolic Model Checking. In Proceedings of the 28th Design Automation Conference, pages 403-407, 1991.","title":"Representing Circuits More Efficiently in Symbolic Model Checking","authors":"Jerry R Burch, Edmund M Clarke, David E Long","year":"1991","venue":"Proceedings of the 28th Design Automation Conference","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Camacho et al., 2018] Alberto Camacho, Jorge A. Baier, Christian J. Muise, and Sheila A. McIlraith. Finite LTL Synthesis as Planning. In Proceedings of the Twenty- Eighth International Conference on Automated Planning and Scheduling, ICAPS 2018, pages 29-38, 2018.","title":"Finite LTL Synthesis as Planning","authors":"Alberto Camacho, Jorge A Baier, Christian J Muise, Sheila A Mcilraith","year":"2018","venue":"Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, ICAPS 2018","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Chakraborty et al., 2018] Supratik Chakraborty, Dror Fried, Lucas M. Tabajara, and Moshe Y. Vardi. Functional Syn- thesis via Input-Output Separation. In 2018 Formal Meth- ods in Computer Aided Design, FMCAD 2018, pages 1-9, 2018.","title":"Functional Synthesis via Input-Output Separation","authors":"Supratik Chakraborty, Dror Fried, Lucas M Tabajara, Moshe Y Vardi","year":"2018","venue":"Formal Methods in Computer Aided Design","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[De Giacomo and Vardi, 2013] Giuseppe De Giacomo and Moshe Y. Vardi. Linear Temporal Logic and Linear Dy- namic Logic on Finite Traces. In IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial In- telligence, pages 854-860, 2013.","title":"Linear Temporal Logic and Linear Dynamic Logic on Finite Traces","authors":"De Giacomo, Giuseppe De Vardi, Moshe Y Giacomo, Vardi","year":"2013","venue":"IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[De Giacomo and Vardi, 2015] Giuseppe De Giacomo and Moshe Y. Vardi. Synthesis for LTL and LDL on Finite Traces. In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, 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":"Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Fried et al., 2016] Dror Fried, Lucas M. Tabajara, and Moshe Y. Vardi. BDD-Based Boolean Functional Synthe- sis. In Computer Aided Verification -28th International Conference, CAV 2016, Proceedings, Part II, pages 402- 421, 2016.","title":"BDD-Based Boolean Functional Synthesis","authors":"Dror Fried, Lucas M Tabajara, Moshe Y Vardi","year":"2016","venue":"Computer Aided Verification -28th International Conference, CAV 2016, Proceedings, Part II","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Fried et al., 2018] Dror Fried, Axel Legay, Joël Ouaknine, and Moshe Y. Vardi. Sequential Relational Decomposi- tion. In Proceedings of the 33rd Annual ACM/IEEE Sym- posium on Logic in Computer Science, LICS 2018, pages 432-441, 2018.","title":"Sequential Relational Decomposition","authors":"Dror Fried, Axel Legay, Joël Ouaknine, Moshe Y Vardi","year":"2018","venue":"Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Geist and Beer, 1994] Daniel Geist and Ilan Beer. Efficient Model Checking by Automated Ordering of Transition Relation Partitions. In Computer Aided Verification, 6th International Conference, CAV '94, Proceedings, pages 299-310, 1994.","title":"Efficient Model Checking by Automated Ordering of Transition Relation Partitions","authors":"Beer Geist, Daniel Geist, Ilan Beer","year":"1994","venue":"Computer Aided Verification, 6th International Conference, CAV '94, Proceedings","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[He et al., 2017] Keliang He, Morteza Lahijanian, Lydia E. Kavraki, and Moshe Y. Vardi. Reactive Synthesis for Fi- nite Tasks under Resource Constraints. In 2017 IEEE/RSJ International Conference on Intelligent Robots and Sys- tems, IROS 2017, pages 5326-5332, 2017.","title":"Reactive Synthesis for Finite Tasks under Resource Constraints","authors":"He","year":"2017","venue":"IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2017","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Henriksen et al., 1995] Jesper G. Henriksen, Jakob L. Jensen, Michael E. Jørgensen, Nils Klarlund, Robert Paige, Theis Rauhe, and Anders Sandholm. Mona: Monadic Second-Order Logic in Practice. In Tools and Al- gorithms for Construction and Analysis of Systems, First International Workshop, TACAS '95, Proceedings, pages 89-110, 1995.","title":"Mona: Monadic Second-Order Logic in Practice","authors":"Henriksen","year":"1995","venue":"Tools and Algorithms for Construction and Analysis of Systems, First International Workshop, TACAS '95, Proceedings","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Jobstmann and Bloem, 2006] Barbara Jobstmann and Rod- erick Bloem. Optimizations for LTL Synthesis. In For- mal Methods in Computer-Aided Design, 6th International Conference, FMCAD 2006, pages 117-124, 2006.","title":"Barbara Jobstmann and Roderick Bloem. Optimizations for LTL Synthesis","authors":"Bloem Jobstmann","year":"2006","venue":"Formal Methods in Computer-Aided Design, 6th International Conference, FMCAD 2006","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[John et al., 2015] Ajith K. John, Shetal Shah, Supratik Chakraborty, Ashutosh Trivedi, and S. Akshay. Skolem Functions for Factored Formulas. In Formal Methods in Computer-Aided Design, FMCAD 2015, pages 73-80, 2015.","title":"Skolem Functions for Factored Formulas","authors":"K Ajith, Shetal John, Supratik Shah, Ashutosh Chakraborty, S Trivedi, Akshay","year":"2015","venue":"Formal Methods in Computer-Aided Design","doi":null,"url":null,"internal_url":null},{"position":15,"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":16,"raw":"[McMahan et al., 2004] Benjamin J. McMahan, Guoqiang Pan, Patrick Porter, and Moshe Y. Vardi. Projection Push- ing Revisited. In Advances in Database Technology - EDBT 2004, 9th International Conference on Extending Database Technology, Proceedings, pages 441-458, 2004.","title":"Projection Pushing Revisited","authors":"Benjamin J Mcmahan, Guoqiang Pan, Patrick Porter, Moshe Y Vardi","year":"2004","venue":"Advances in Database Technology -EDBT 2004, 9th International Conference on Extending Database Technology, Proceedings","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Meyer et al., 2018] Philipp J. Meyer, Salomon Sickert, and Michael Luttenberger. Strix: Explicit Reactive Synthesis Strikes Back! In Computer Aided Verification -30th Inter- national Conference, CAV 2018, Held as Part of the Fed- erated Logic Conference, FloC 2018, Proceedings, Part I, pages 578-586, 2018.","title":"Strix: Explicit Reactive Synthesis Strikes Back!","authors":"J Philipp, Salomon Meyer, Michael Sickert, Luttenberger","year":"2018","venue":"Computer Aided Verification -30th International Conference, CAV 2018, Held as Part of the Federated Logic Conference, FloC 2018, Proceedings, Part I","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Pan and Vardi, 2005] Guoqiang Pan and Moshe Y. Vardi. Symbolic Techniques in Satisfiability Solving. J. Autom. Reasoning, 35(1-3):25-50, 2005.","title":"Symbolic Techniques in Satisfiability Solving","authors":"Pan, ; ] Guoqiang Vardi, Moshe Y Pan, Vardi","year":"2005","venue":"J. Autom. Reasoning","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Tabajara and Vardi, 2017] Lucas M. Tabajara and Moshe Y. Vardi. Factored Boolean Functional Synthesis. In 2017 Formal Methods in Computer Aided Design, FMCAD 2017, pages 124-131, 2017.","title":"Factored Boolean Functional Synthesis","authors":"Lucas M Tabajara, Moshe Y Vardi","year":"2017","venue":"Formal Methods in Computer Aided Design, FMCAD 2017","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Zhu et al., 2017] Shufang Zhu, Lucas M. Tabajara, Jianwen Li, Geguang Pu, and Moshe Y. Vardi. Symbolic LTLf Syn- thesis. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, pages 1362-1369, 2017.","title":"Symbolic LTLf Synthesis","authors":"Shufang Zhu, Lucas M Tabajara, Jianwen Li, Geguang Pu, Moshe Y Vardi","year":"2017","venue":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}