Performance heuristics for GR(1) synthesis and related algorithms

Elizabeth Firman*, Shahar Maoz, Jan Oliver Ringert

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review


Reactive synthesis for the GR(1) fragment of LTL has been implemented and studied in many works. In this workshop paper we present and evaluate a list of heuristics to potentially reduce running times for GR(1) synthesis and related algorithms. The list includes early detection of fixed-points and unrealizability, fixed-point recycling, and heuristics for unrealizable core computations. We evaluate the presented heuristics on SYNTECH15, a total of 78 specifications of 6 autonomous Lego robots, written by 3rd year undergraduate computer science students in a project class we have taught, as well as on several benchmarks from the literature. The evaluation investigates not only the potential of the suggested heuristics to improve computation times, but also the difference between existing benchmarks and the robot's specifications in terms of the effectiveness of the heuristics.

Original languageEnglish
Pages (from-to)62-80
Number of pages19
JournalElectronic Proceedings in Theoretical Computer Science, EPTCS
StatePublished - 28 Nov 2017
Event6th Workshop on Synthesis, SYNT 2017 - Heidelberg, Germany
Duration: 22 Jul 2017 → …


Dive into the research topics of 'Performance heuristics for GR(1) synthesis and related algorithms'. Together they form a unique fingerprint.

Cite this