72 research outputs found
Specification Format for Reactive Synthesis Problems
Automatic synthesis from a given specification automatically constructs
correct implementation. This frees the user from the mundane implementation
work, but still requires the specification. But is specifying easier than
implementing? In this paper, we propose a user-friendly format to ease the
specification work, in particularly, that of specifying partial
implementations. Also, we provide scripts to convert specifications in the new
format into the SYNTCOMP format, thus benefiting from state of the art
synthesizers.Comment: In Proceedings SYNT 2015, arXiv:1602.0078
Guessing Winning Policies in LTL Synthesis by Semantic Learning
We provide a learning-based technique for guessing a winning strategy in a
parity game originating from an LTL synthesis problem. A cheaply obtained guess
can be useful in several applications. Not only can the guessed strategy be
applied as best-effort in cases where the game's huge size prohibits rigorous
approaches, but it can also increase the scalability of rigorous LTL synthesis
in several ways. Firstly, checking whether a guessed strategy is winning is
easier than constructing one. Secondly, even if the guess is wrong in some
places, it can be fixed by strategy iteration faster than constructing one from
scratch. Thirdly, the guess can be used in on-the-fly approaches to prioritize
exploration in the most fruitful directions.
In contrast to previous works, we (i)~reflect the highly structured logical
information in game's states, the so-called semantic labelling, coming from the
recent LTL-to-automata translations, and (ii)~learn to reflect it properly by
learning from previously solved games, bringing the solving process closer to
human-like reasoning
Reactive Synthesis from Extended Bounded Response LTL Specifications
Reactive synthesis is a key technique for the design of
correct-by-construction systems and has been thoroughly investigated in the
last decades. It consists in the synthesis of a controller that reacts to
environment's inputs satisfying a given temporal logic specification. Common
approaches are based on the explicit construction of automata and on their
determinization, which limit their scalability.
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 covering a large set of practical
cases), and we show that reactive synthesis from \LTLEBR specifications can be
reduced to solving a safety game over a deterministic symbolic automaton built
directly from the specification. We prove the correctness of the proposed
approach and we successfully evaluate it on various benchmarks.Comment: Extended Versio
The 4th Reactive Synthesis Competition (SYNTCOMP 2017): Benchmarks, Participants & Results
We report on the fourth reactive synthesis competition (SYNTCOMP 2017). We
introduce two new benchmark classes that have been added to the SYNTCOMP
library, and briefly describe the benchmark selection, evaluation scheme and
the experimental setup of SYNTCOMP 2017. We present the participants of
SYNTCOMP 2017, with a focus on changes with respect to the previous years and
on the two completely new tools that have entered the competition. Finally, we
present and analyze the results of our experimental evaluation, including a
ranking of tools with respect to quantity and quality of solutions.Comment: In Proceedings SYNT 2017, arXiv:1711.10224. arXiv admin note: text
overlap with arXiv:1609.0050
The Reactive Synthesis Competition: SYNTCOMP 2016 and Beyond
We report on the design of the third reactive synthesis competition (SYNTCOMP
2016), including a major extension of the competition to specifications in full
linear temporal logic. We give a brief overview of the synthesis problem as
considered in SYNTCOMP, and present the rules of the competition in 2016, as
well as the ideas behind our design choices. Furthermore, we evaluate the
recent changes to the competition based on the experiences with SYNTCOMP 2016.
Finally, we give an outlook on further changes and extensions of the
competition that are planned for the future.Comment: In Proceedings SYNT 2016, arXiv:1611.0717
- …