The 4th Reactive Synthesis Competition (SYNTCOMP 2017): Benchmarks, Participants &amp; Results

Jacobs, Swen; Basset, Nicolas; Bloem, Roderick; Brenguier, Romain; Colange, Maximilien; Faymonville, Peter; Finkbeiner, Bernd; Khalimov, Ayrat; Klein, Felix; Michaud, Thibaud; Pérez, Guillermo A.; Raskin, Jean-François; Sankur, Ocan; Tentrup, Leander

doi:10.4204/eptcs.260.10

Cited by 41 publications

(47 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Experimental Design. We approach all three research questions by evaluating the different tools and configurations on the specifications from the TLFS/LTLtrack of the Syntcomp2019 competition 7 , which subsumes all benchmarks of Syntcomp2018 [25]. To the best of our knowledge this dataset is the most complete set of LTL specifications for synthesis stemming from a wide range of different applications.…”

Section: Experimental Evaluationmentioning

confidence: 99%

Practical synthesis of reactive systems from LTL specifications via parity games

2019

View full text Add to dashboard Cite

You can teach an old dog new tricks: making a classic approach structured, forward-explorative, and incremental. Abstract The synthesis of reactive systems from linear temporal logic (LTL) specifications is an important aspect in the design of reliable software and hardware. We present our adaption of the classic automata-theoretic approach to LTL synthesis, implemented in the tool Strix which has won the two last synthesis competitions (Syntcomp2018/2019). The presented approach is (1) structured, meaning that the states used in the construction have a semantic structure that is exploited in several ways, it performs a (2) forward exploration such that it often constructs only a small subset of the reachable states, and it is (3) incremental in the sense that it reuses results from previous inconclusive solution attempts. Further, we present and study different guiding heuristics that determine where to expand the on-demand constructed arena. Moreover, we show several techniques for extracting an implementation (Mealy machine or circuit) from the witness of the tree-automaton emptiness check. Lastly, the chosen constructions use a symbolic representation of the transition functions to reduce runtime and memory consumption. We evaluate the proposed techniques on the Syntcomp2019 benchmark set and show in more detail how the proposed techniques compare to the techniques implemented in other leading LTL synthesis tools.

show abstract

Section: Experimental Evaluationmentioning

confidence: 99%

Practical synthesis of reactive systems from LTL specifications via parity games

2019

View full text Add to dashboard Cite

show abstract

“…These are 313 model-checking and 216 equivalence checking games. Furthermore, we consider a new category of 223 "reactive synthesis" benchmarks obtained via the LTL synthesis tool STRIX [19] from the synthesis competition [12]. See also Table 1.…”

Section: Empirical Evaluationmentioning

confidence: 99%

Simple Fixpoint Iteration To Solve Parity Games

Dijk

Rubbens

2019

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

A naive way to solve the model-checking problem of the mu-calculus uses fixpoint iteration. Traditionally however mu-calculus model-checking is solved by a reduction in linear time to a parity game, which is then solved using one of the many algorithms for parity games.We now consider a method of solving parity games by means of a naive fixpoint iteration. Several fixpoint algorithms for parity games have been proposed in the literature. In this work, we introduce an algorithm that relies on the notion of a distraction. The idea is that this offers a novel perspective for understanding parity games. We then show that this algorithm is in fact identical to two earlier published fixpoint algorithms for parity games and thus that these earlier algorithms are the same.Furthermore, we modify our algorithm to only partially recompute deeper fixpoints after updating a higher set and show that this modification enables a simple method to obtain winning strategies.We show that the resulting algorithm is simple to implement and offers good performance on practical parity games. We empirically demonstrate this using games derived from model-checking, equivalence checking and reactive synthesis and show that our fixpoint algorithm is the fastest solution for model-checking games.

show abstract

“…A synthesized implementation of a system from its specification is given by a transducer (a Mealy or Moore machine). Due to its large state space, there is a general trend to represent transducers succinctly by binary decision diagrams (BDD) or circuits [33]. Such artifacts give symbolic representations of transducers that are easy to process but have the drawback of not mirroring the original functional choices of an implementation.…”

Section: Representation Of Implementationsmentioning

confidence: 99%

The Challenges in Specifying and Explaining Synthesized Implementations of Reactive Systems

Kress-Gazit

Torfah

2019

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

In formal synthesis of reactive systems an implementation of a system is automatically constructed from its formal specification. The great advantage of synthesis is that the resulting implementation is correct by construction; therefore there is no need for manual programming and tedious debugging tasks. Developers remain, nevertheless, hesitant to using automatic synthesis tools and still favor manually writing code. A common argument against synthesis is that the resulting implementation does not always give a clear picture on what decisions were made during the synthesis process. The outcome of synthesis tools is mostly unreadable and hinders the developer from understanding the functionality of the resulting implementation. Many attempts have been made in the last years to make the synthesis process more transparent to users. Either by structuring the outcome of synthesis tools or by providing additional automated support to help users with the specification process.In this paper we discuss the challenges in writing specifications for reactive systems and give a survey on what tools have been developed to guide users in specifying reactive systems and understanding the outcome of synthesis tools.

show abstract

The 4th Reactive Synthesis Competition (SYNTCOMP 2017): Benchmarks, Participants & Results

Cited by 41 publications

References 46 publications

Practical synthesis of reactive systems from LTL specifications via parity games

Practical synthesis of reactive systems from LTL specifications via parity games

Simple Fixpoint Iteration To Solve Parity Games

The Challenges in Specifying and Explaining Synthesized Implementations of Reactive Systems

Contact Info

Product

Resources

About