SemML 2.0: Synthesizing Controllers for LTL

arXiv cs.AI / 4/28/2026

📰 NewsDeveloper Stack & InfrastructureIdeas & Deep AnalysisModels & Research

Key Points

  • SemML 2.0 is a new tool for synthesizing reactive controllers from linear temporal logic (LTL) specifications using Mealy-machine/AIGER-style representations.
  • The update improves performance over existing state-of-the-art tools by combining the classical automata-theoretic approach with partial exploration and machine-learning-guided search.
  • It also introduces multiple heuristics and algorithmic refinements aimed at producing smaller and more efficient controller representations.
  • In evaluations on the SYNTCOMP benchmark dataset, SemML 2.0 solves significantly more synthesis instances and does so faster than tools including Strix, LtlSynt, and SemML 1.0, while keeping solution quality at the state of the art.

Abstract

Synthesizing a reactive system from specifications given in linear temporal logic (LTL) is a classical problem, finding its applications in safety-critical systems design. These systems are typically represented using either Mealy machines or AIGER circuits. We present the second version of SemML, which outperforms all state-of-the-art tools for finding either solution. Aside from implementing the classical automata-theoretic approach, our tool utilizes partial exploration and machine-learning guidance for obtaining solutions efficiently, and numerous heuristics and improvements of classic algorithms for extracting small representations of these solutions. We evaluate our tool against the existing state-of-the-art tools (in particular Strix, LtlSynt, and the previous version of SemML) on the dataset of the synthesis competition SYNTCOMP. We show that we solve significantly more instances and do so much faster than other tools, while maintaining state-of-the-art solution quality.