A central aim and ever-lasting dream of computer science is to put the development of
hardware and software systems on a mathematical basis which is both firm and practical …

Infinite Words is an important theory in both Mathematics and Computer Sciences. Many
new developments have been made in the field, encouraged by its application to problems …

In this paper we develop a new algorithm for deciding the winner in parity games, and hence
also for the modal μ-calculus model checking. The design and analysis of the algorithm is …

In this paper we revisit Safra's determinization constructions for automata on infinite words.
We show how to construct deterministic automata with fewer states and, most importantly …

We describe the automata-theoretic approach to the algorithmic verification of probabilistic
finite-state systems with respect to linear-time properties. The basic idea underlying this …

Automata on infinite words are used for specification and verification of nonterminating
programs. Different types of automata induce different levels of expressive power, of …

The recent breakthrough paper by Calude et al. has given the first algorithm for solving
parity games in quasi-polynomial time, where previously the best algorithms were mildly …

The linear time μ-calculus extends LTL with arbitrary least and greatest fixpoint operators.
This gives it the power to express all ω-regular languages, ie strictly more than LTL. The …

Inductive definitions are the most natural means by which to represent many families of
structures occurring in mathematics and computer science, and their corresponding …

In [Saf88] an exponential determination procedure for Büchi automata was shown, yielding
tight bounds for decision procedures of some logics ([EJ88, Saf88, SV89, KT89]). In [SV89] …