arXiv:1604.02284v1 [cs.LO] 8 Apr 2016 Submitted to: SYNT 2016 c  S. Jacobs, F. Klein This work is licensed under the Creative Commons Attribution License. A High-Level LTL Synthesis Format: TLSF v1.1 (Extended Version) Swen Jacobs Saarland University Saarbr¨ ucken, Germany jacobs@react.uni-saarland.de Felix Klein Saarland University Saarbr¨ ucken, Germany klein@react.uni-saarland.de We present the Temporal Logic Synthesis Format (TLSF), a high-level format to describe syn- thesis problems via Linear Temporal Logic (LTL). The format builds upon standard LTL, but additionally allows to use high-level constructs, such as sets and functions, to provide a compact and human-readable representation. Furthermore, the format allows to identify parameters of a specification such that a single description can be used to define a family of problems. Addition- ally, we present a tool to automatically translate the format into plain LTL, which then can be used for synthesis by a solver. The tool also allows to adjust parameters of the specification and to apply standard transformations on the resulting formula. 1 Introduction The automatic synthesis of reactive systems from formal specifications has been one of the major challenges of computer science, and an active field of research, since the definition of the problem by Church [6]. For specifications in linear temporal logic the problem is 2EXPTIME-complete, and a number of fundamental approaches to solve this problem have been proposed [5, 24, 23], based on a translation of the specification into a game or an automaton. Recently, there has been a lot of work on solving synthesis problems more efficiently, either by restricting the specification language [4, 22], or by a smart exploration of the search space [15, 9, 12, 26, 14, 13]. However, as already noted by Ehlers [8], it has been very hard to compare different synthesis tools. A major reason for this was the lack of a common language and a benchmark library on which to compare tools. As a consequence, there has also been a lack of incentive for the development of efficient implementations of new synthesis approaches. To some extent, this has changed with the advent of the reactive synthesis competition (SYNT- COMP) [17, 18], which has been organized in order to encourage the development of mature and efficient synthesis tools. However, SYNTCOMP thus far was restricted to safety specifications in an extension of the AIGER format [16], a low-level format that is not suited for writing expressive spec- ifications by hand. Moreover, AIGER files directly represent a (safety) game, and the translation of a temporal logic specification to a suitable game (or other intermediate representations) is a non-trivial part of the synthesis problem that is removed from the picture if we start from an AIGER specification. In this paper, we introduce the temporal logic synthesis format (TLSF), a high-level format for the specification of synthesis problems. The goal of TLSF is to create a format that (i) makes it convenient to write expressive specifications by hand, and at the same time (ii) is easy to support by synthesis tools. To achieve the first goal, TLSF allows to define synthesis problems with high-level temporal logic specifications, and supports a number of additional features. These include user-defined enumeration