Abstract We present Spot 2.0, a C++ library with Python bindings and an assortment of
command-line tools designed to manipulate LTL and ω-automata in batch. New automata …

We report on the last four editions of the reactive synthesis competition (SYNTCOMP 2018–
2021). We briefly describe the evaluation scheme and the experimental setup of …

We present Rabinizer 4, a tool set for translating formulae of linear temporal logic to different
types of deterministic ω-automata. The tool set implements and optimizes several recent …

Abstract In 2021, Casares, Colcombet, and Fijalkow introduced the Alternating Cycle
Decomposition (ACD) to study properties and transformations of Muller automata. We …

We present a new algorithm to construct a (generalized) deterministic Rabin automaton for
an LTL formula φ. The automaton is the product of a master automaton and an array of slave …

Spot is a library of model-checking algorithms started in 2003. This paper focuses on its
module for translating linear-time temporal logic (LTL) formulas into Büchi automata: one of …

Abstract Model checking is a fully automated, formal method for demonstrating absence of
bugs in reactive systems. Here, bugs are violations of properties in Linear-time Temporal …

We present a tool for translating LTL formulae into deterministic ω-automata. It is the first tool
that covers the whole LTL that does not use Safra's determinization or any of its variants …

We introduce a new algorithm that takes a Transition-based Emerson-Lei Automaton
(TELA), that is, an ω-automaton whose acceptance condition is an arbitrary Boolean formula …

We introduce an efficient complementation technique for semi-deterministic Büchi automata,
which are Büchi automata that are deterministic in the limit: from every accepting state …