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 …

We propose several heuristics for mitigating one of the main causes of combinatorial
explosion in rank-based complementation of Büchi automata (BAs): unnecessarily high …

Abstract We present ROLL 1.0, an ω-regular language learning library with command line
tools to learn and complement Büchi automata. This open source Java library implements all …

This paper provides several optimizations of the rank-based approach for complementing
Büchi automata. We start with Schewe's theoretically optimal construction and develop a set …

Complementation of nondeterministic Büchi automata (BAs) is an important problem in
automata theory with numerous applications in formal verification, such as termination …

Complementation of Büchi automata is an essential technique used in some approaches for
termination analysis of programs. The long search for an optimal complementation …

Monadic second-order logic of one successor (S1S) is a logic for specifying ω ω-regular
languages in a concise way. In this paper, we revisit the classical decision procedure based …

We give new constructions for complementing subclasses of Emerson-Lei automata using
modifications of rank-based B\" uchi automata complementation. In particular, we propose a …

This paper provides several optimizations of the rank-based approach for complementing
B\"{u} chi automata. We start with Schewe's theoretically optimal construction and develop a …

Complementation of nondeterministic B\" uchi automata (BAs) is an important problem in
automata theory with numerous applications in formal verification, such as termination …