The first reactive synthesis competition (SYNTCOMP 2014)

Abstract

Abstract. We introduce the reactive synthesis competition (SYNTCOMP), a long-term effort intended to stimulate and guide advances in the design and application of synthesis procedures for reactive systems. The first iteration of SYNTCOMP is based on the controller synthesis problem for finite-state systems and safety specifications. We provide an overview of this problem and existing approaches to solve it, and report on the design and results of the first SYNTCOMP. This includes the definition of the benchmark format, the collection of benchmarks, the rules of the competition, and the five synthesis tools that participated. We present and analyze the results of the competition and draw conclusions on the state of the art. Finally, we give an outlook on future directions of SYNTCOMP.

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

“…For additional details on the implemented techniques and optimizations, we refer to the previous SYNTCOMP reports [22][23][24].…”

“…The reactive synthesis competition (SYNTCOMP) has been founded in 2014 [22] with the goal to increase the impact of theoretical advancements in the automatic synthesis of reactive systems. Reactive synthesis is one of the major challenges of computer science since the definition of the problem more than 50 years ago [11].…”

“…[22][23][24] A design choice for the first two competitions was to focus on safety properties specified as monitor circuits in an extension of the AIGER format known from the hardware model checking competition [9,20]. SYNTCOMP 2016 introduced the first major extension of the competition by adding a new track that is based on properties in full linear temporal logic (LTL), given in the temporal logic synthesis format (TLSF) [21,25].…”

Performance Heuristics for GR(1) Synthesis and Related Algorithms

“…It is well-known that the order of BDD variables heavily influences the performance of BDD-based algorithms [11,33]. The GR(1) implementation of Slugs [8] uses the default dynamic variable reordering of CUDD [31] (as we do).…”

“…Finally, a number of heuristics for BDD-based safety game solvers have been reported as outcome of the SYNTCOMP reactive synthesis competitions [11,12,13]. Most of these optimizations are on the level of predecessor computations (operators in Alg.…”