%0 Journal Article %1 journals/acta/LuttenbergerMS20 %A Luttenberger, Michael %A Meyer, Philipp J. %A Sickert, Salomon %D 2020 %J Acta Inf. %K journal %N 1-2 %P 3-36 %R 10.1007/s00236-019-00349-3 %T Practical synthesis of reactive systems from LTL specifications via parity games. %U https://doi.org/10.1007/s00236-019-00349-3 %V 57 %X 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.

@article{journals/acta/LuttenbergerMS20, 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.}, added-at = {2020-09-30T17:30:54.000+0200}, author = {Luttenberger, Michael and Meyer, Philipp J. and Sickert, Salomon}, biburl = {https://www.bibsonomy.org/bibtex/276cee6878ec9b739441768d3bb964e93/paves}, doi = {10.1007/s00236-019-00349-3}, ee = {https://doi.org/10.1007/s00236-019-00349-3}, interhash = {49cf0a061d210f76193c039e69a4b183}, intrahash = {76cee6878ec9b739441768d3bb964e93}, journal = {Acta Inf.}, keywords = {journal}, note = {https://arxiv.org/abs/1903.12576}, number = {1-2}, pages = {3-36}, timestamp = {2023-09-24T19:44:03.000+0200}, title = {Practical synthesis of reactive systems from LTL specifications via parity games.}, url = {https://doi.org/10.1007/s00236-019-00349-3}, volume = 57, year = 2020 }