Strix: Explicit Reactive Synthesis Strikes Back!

Strix is a new tool for reactive LTL synthesis combining a direct translation of LTL formulas into deterministic parity automata (DPA) and an efficient, multi-threaded explicit state solver for parity games. In brief, Strix (1) decomposes the given formula into simpler formulas, (2) translates these on-the-fly into DPAs based on the queries of the parity game solver, (3) composes the DPAs into a parity game, and at the same time already solves the intermediate games using strategy iteration, and (4) finally translates the winning strategy, if it exists, into a Mealy machine or an AIGER circuit with optional minimization using external tools. We experimentally demonstrate the applicability of our approach by a comparison with Party, BoSy, and ltlsynt using the syntcomp2017 benchmarks. In these experiments, our prototype can compete with BoSy and ltlsynt with only Party performing slightly better. In particular, our prototype successfully synthesizes the full and unmodified LTL specification of the AMBA protocol for \(n=2\) masters.

[1]  Jan Kretínský,et al.  Limit-Deterministic Büchi Automata for Linear Temporal Logic , 2016, CAV.

[2]  Alexandre Duret-Lutz,et al.  Spot 2.0 - A Framework for LTL and \omega -Automata Manipulation , 2016, ATVA.

[3]  Jan Reineke,et al.  MEMIN: SAT-based exact minimization of incompletely specified Mealy machines , 2015, 2015 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[4]  Jan Kretínský,et al.  From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata , 2017, TACAS.

[5]  Robert K. Brayton,et al.  ABC: An Academic Industrial-Strength Verification Tool , 2010, CAV.

[6]  Bernd Finkbeiner,et al.  The 5th Reactive Synthesis Competition (SYNTCOMP 2018): Benchmarks, Participants & Results , 2019, ArXiv.

[7]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.

[8]  Klaus Schneider,et al.  Exploiting the Temporal Logic Hierarchy and the Non-Confluence Property for Efficient LTL Synthesis , 2010, GANDALF.

[9]  Rüdiger Ehlers,et al.  Unbeast: Symbolic Bounded Synthesis , 2011, TACAS.

[10]  Véronique Bruyère,et al.  Acacia+, a Tool for LTL Synthesis , 2012, CAV.

[11]  Krishnendu Chatterjee,et al.  Synthesis of AMBA AHB from formal specification: a case study , 2011, International Journal on Software Tools for Technology Transfer.

[12]  Michael Luttenberger,et al.  Solving Mean-Payoff Games on the GPU , 2016, ATVA.

[13]  Michael Luttenberger,et al.  Solving Parity Games on the GPU , 2013, ATVA.

[14]  Roderick Bloem,et al.  Optimizations for LTL Synthesis , 2006, 2006 Formal Methods in Computer Aided Design.

[15]  Marco Roveri,et al.  The nuXmv Symbolic Model Checker , 2014, CAV.

[16]  Amir Pnueli,et al.  Synthesis of Reactive(1) Designs , 2006, VMCAI.

[17]  Michael Luttenberger,et al.  Strategy Iteration using Non-Deterministic Strategies for Solving Parity Games , 2008, ArXiv.

[18]  Bernd Finkbeiner,et al.  BoSy: An Experimentation Framework for Bounded Synthesis , 2017, CAV.

[19]  Amir Pnueli,et al.  Specify, Compile, Run: Hardware from PSL , 2007, COCV@ETAPS.

[20]  Roderick Bloem,et al.  Parameterized Synthesis Case Study: AMBA AHB , 2014, SYNT.

[21]  Roderick Bloem,et al.  PARTY Parameterized Synthesis of Token Rings , 2013, CAV.

[22]  Thomas Wilke,et al.  Automata logics, and infinite games: a guide to current research , 2002 .

[23]  Thomas Wilke,et al.  Automata Logics, and Infinite Games , 2002, Lecture Notes in Computer Science.