History-deterministic automata are an intermediate automata model, in between
deterministic and nondeterministic ones. An automaton is history-deterministic if its …

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 …

Parity games play an important role in model checking and synthesis. In their paper, Calude
et al. have recently shown that these games can be solved in quasi-polynomial time. We …

Parity games have important practical applications in formal verification and synthesis,
especially to solve the model-checking problem of the modal mu-calculus. They are also …

The complexity class CLS was proposed by Daskalakis and Papadimitriou in 2011 to
understand the complexity of important NP search problems that admit both path following …

We train hierarchical Transformers on the task of synthesizing hardware circuits directly out
of high-level logical specifications in linear-time temporal logic (LTL). The LTL synthesis …

We report on the fourth reactive synthesis competition (SYNTCOMP 2017). We introduce two
new benchmark classes that have been added to the SYNTCOMP library, and briefly …

We provide a survey of the state of the art of rational verification: the problem of checking
whether a given temporal logic formula ϕ is satisfied in some or all game-theoretic equilibria …

We show that the problem of finding a Resolution refutation that is at most polynomially
longer than a shortest one is NP-hard. In the parlance of proof complexity, Resolution is not …

We present a new quasi-polynomial algorithm for solving parity games. It is based on a new
bisimulation invariant measure of complexity for parity games, called the register-index …