Filters








13 Hits in 1.2 sec

Improvements to ltlsynt

Florian Renkin, Philipp Schlehuber, Alexandre Duret-Lutz, Adrien Pommellet
2022
ltlsynt is a tool for LTL reactive synthesis. We summarize its evolution since 2018.  ...  At this point, transitions are labeled marizes the improvements brought to ltlsynt since then.  ...  to ltlsynt along the way.  ... 
doi:10.48550/arxiv.2201.05376 fatcat:nk2ygqmua5bwlhqlshlqkuq3zm

Strix: Explicit Reactive Synthesis Strikes Back! [chapter]

Philipp J. Meyer, Salomon Sickert, Michael Luttenberger
2018 Lecture Notes in Computer Science  
In these experiments, our prototype can compete with BoSy and ltlsynt with only Party performing slightly better.  ...  We experimentally demonstrate the applicability of our approach by a comparison with Party, BoSy, and ltlsynt using the syntcomp2017 benchmarks.  ...  We believe that a pure C++ implementation will further improve the overall runtime and reduce the memory footprint.  ... 
doi:10.1007/978-3-319-96145-3_31 fatcat:f3gcoh23ujd3vadfvpmj3tqpga

The 5th Reactive Synthesis Competition (SYNTCOMP 2018): Benchmarks, Participants & Results [article]

Swen Jacobs and Roderick Bloem and Maximilien Colange and Peter Faymonville and Bernd Finkbeiner and Ayrat Khalimov and Felix Klein and Michael Luttenberger and Philipp J. Meyer and Thibaud Michaud and Mouhammad Sakr and Salomon Sickert and Leander Tentrup and Adam Walker
2019 arXiv   pre-print
We give an overview of the participants of SYNTCOMP 2018 and highlight changes compared to previous years.  ...  Finally, we present and analyze the results of our experimental evaluation, including a ranking of tools with respect to quantity and quality of solutions.  ...  To solve the synthesis problem, ltlsynt uses a translation to parity games.  ... 
arXiv:1904.07736v1 fatcat:omb2xnqxevbozbdef6d47s3s2a

From Spot 2.0 to Spot 2.10: What's New? [article]

Alexandre Duret-Lutz, Jérôme Dubois, Clément Gillard, Henrich Lauko
2022 arXiv   pre-print
We also shed some lights on the data-structure used to store automata.  ...  This paper summarizes its evolution over the past six years, since the release of Spot 2.0, which was the first version to support ω-automata with arbitrary acceptance conditions, and the last version  ...  Not appearing in this list are many micro-optimizations and usability improvements that Spot has accumulated over the years.  ... 
arXiv:2206.11366v1 fatcat:ukei6ijbtvhjtozbuwb7kcxiyi

The Reactive Synthesis Competition (SYNTCOMP): 2018-2021 [article]

Swen Jacobs, Guillermo A. Perez, Remco Abraham, Veronique Bruyere, Michael Cadilhac, Maximilien Colange, Charly Delfosse, Tom van Dijk, Alexandre Duret-Lutz, Peter Faymonville, Bernd Finkbeiner, Ayrat Khalimov (+13 others)
2022 arXiv   pre-print
Then, we introduce new benchmark classes that have been added to the SYNTCOMP library and give an overview of the participants of SYNTCOMP.  ...  Finally, we present and analyze the results of our experimental evaluations, including a ranking of tools with respect to quantity and quality of solutions.  ...  Ltlsynt The program ltlsynt, introduced to SYNT-COMP in 2017 (see Table 2 ) is part of Spot (Duret-Lutz et al, 2016) .  ... 
arXiv:2206.00251v1 fatcat:qvg2cqgvjvaa7kpfd3nrbj4ahu

Reactive Synthesis from Extended Bounded Response LTL Specifications [article]

Alessandro Cimatti, Luca Geatti, Nicola Gigante, Angelo Montanari, Stefano Tonetta
2020 arXiv   pre-print
It consists in the synthesis of a controller that reacts to environment's inputs satisfying a given temporal logic specification.  ...  In this paper, we introduce a new fragment of Linear Temporal Logic, called Extended Bounded Response LTL (\LTLEBR), that allows one to combine bounded and universal unbounded temporal operators (thus  ...  Acknowledgments: The authors want to thank all the anonymous reviewers of FMCAD 2020 for the insightful comments on a preliminary version of this paper.  ... 
arXiv:2008.05335v1 fatcat:q6b754tigjclla2yhkcu6y2hmi

Practical Synthesis of Reactive Systems from LTL Specifications via Parity Games [article]

Michael Luttenberger and Philipp J. Meyer and Salomon Sickert
2019 arXiv   pre-print
Further, we present and study different guiding heuristics that determine where to expand the on-demand constructed arena.  ...  Lastly, the chosen constructions use a symbolic representation of the transition functions to reduce runtime and memory consumption.  ...  Acknowledgements We want to thank the anonymous reviewers for their helpful comments and remarks on this manuscript. We also want to thank Swen Jacobs and Guillermo A.  ... 
arXiv:1903.12576v2 fatcat:dphca6xfnjc2lkkdgqglkgpwsy

Synthesizing Good-Enough Strategies for LTLf Specifications

Yong Li, Andrea Turrini, Moshe Y. Vardi, Lijun Zhang
2021 Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence   unpublished
We 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  ...  Then we show how to synthesize GE-strategies for LTLf formulas via the Good-Enough (GE)-synthesis of LTL formulas.  ...  Acknowledgements We would like to thank the anonymous reviewers for their valuable suggestions and comments about this paper.  ... 
doi:10.24963/ijcai.2021/570 fatcat:7jtdoi3ucfbzfcyzlrtwed3boy

Reactive Synthesis from Extended Bounded Response LTL Specifications [article]

Alessandro Cimatti, Luca Geatti, Nicola Gigante, Angelo Montanari, Stefano Tonetta, Alexander Ivrii, Ofer Strichman
2020
It consists in the synthesis of a controller that reacts to environment's inputs satisfying a given temporal logic specification.  ...  In this paper, we introduce a new fragment of Linear Temporal Logic, called Extended Bounded Response LTL (LTL EBR ), that allows one to combine bounded and universal unbounded temporal operators (thus  ...  great importance as well: all the effort would be directed to improve the quality of the specification for the controller.  ... 
doi:10.34727/2020/isbn.978-3-85448-042-6_15 fatcat:bemri4n7hfcf7g6i4tlojxh4v4

CTL* synthesis via LTL synthesis

Roderick Bloem, Sven Schewe, Ayrat Khalimov
2017 Electronic Proceedings in Theoretical Computer Science  
These outputs can be used to encode witnesses of the satisfaction of CTL* subformulas directly into the system.  ...  We reduce synthesis for CTL* properties to synthesis for LTL. In the context of model checking this is impossible - CTL* is more expressive than LTL.  ...  We thank SYNT organisers for providing the opportunity to improve the paper, and reviewers for their patience.  ... 
doi:10.4204/eptcs.260.4 fatcat:oeuia2sdtnfnfbxtjmalhbgsre

Specification Decomposition for Reactive Synthesis [article]

Bernd Finkbeiner, Gideon Geier, Noemi Passing
2021 arXiv   pre-print
Our algorithm is a preprocessing technique that can be applied to a wide range of synthesis tools.  ...  Moreover, the composition of the resulting implementations is guaranteed to satisfy the original specification.  ...  Related Work: Compositional approaches are long known to improve the scalability of model checking algorithms significantly [4, 31] .  ... 
arXiv:2103.08459v3 fatcat:vw2czg2bc5gfdh22meekxno4g4

Synthesizing stream control [article]

Felix Klein, Universität Des Saarlandes
2020
To this end, we explore two further possible improvements.  ...  In both scenarios, the developer needs additional feedback from the synthesis engine to debug errors for finally improving the system specification.  ...  Even if not especially listed here, I want to thank all of them.  ... 
doi:10.22028/d291-32255 fatcat:z6ui3badqjbrtoiveem6kvxflm

Reactive Synthesis: Branching Logics and Parameterized Systems [article]

Ayrat Khalimov
2018 arXiv   pre-print
Reactive synthesis is an automatic way to translate a human intention expressed in some logic into a system of some kind. This thesis has two parts, devoted to logic and to systems.  ...  In Part I, we develop two new approaches to CTL* synthesis.  ...  Reducing LTL synthesis to solving parity games is practical, as SYNTCOMP'17 [1] showed: such synthesiser ltlsynt was among the fastest.2 This is a conjecture: we have not proven that the synthesis of  ... 
arXiv:1808.09430v1 fatcat:27ry7e4bwneqno6zmtcw55m23q