In this paper, we look at good-for-games Rabin automata that recognise a Muller language
(a language that is entirely characterised by the set of letters that appear infinitely often in …

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 …

In this paper, we are interested in automata over infinite words and infinite duration games,
that we view as general transition systems. We study transformations of systems using a …

We present a unified translation of linear temporal logic (LTL) formulas into deterministic
Rabin automata (DRA), limit-deterministic Büchi automata (LDBA), and nondeterministic …

We present a unified translation of LTL formulas into deterministic Rabin automata, limit-
deterministic Büchi automata, and nondeterministic Büchi automata. The translations yield …

In synthesis, assumption are constraints on the environments that rule out certain
environment behaviors. A key observation is that even if we consider system with LTLf goals …

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 study transformations of automata and games using Muller conditions into equivalent
ones using parity or Rabin conditions. We present two transformations, one that turns a …

We present the second generation of the tool Seminator that transforms transition-based
generalized Büchi automata (TGBAs) into equivalent semi-deterministic automata. The tool …