A structure has a (finite-string) automatic presentation if the elements of its domain can be
named by finite strings in such a way that the coded domain and the coded atomic …

Model checking is a fully-automatic formal verification method that has been extremely
successful in validating and verifying safety-critical systems in the past three decades. In the …

An overview of applications of two player path-forming games to verification and synthesis is
given. Several extensions of the standard model of finite games with regular winning …

By algorithmic metatheorems for a model checking problem P over infinite-state systems we
mean generic results that can be used to infer decidability (possibly complexity) of P not only …

The model theory of finite structures is intimately connected to various fields in computer
science, including complexity theory, databases, and verification. In particular, there is a …

Formal verification using the model checking paradigm has to deal with two aspects: The
system models are structured, often as products of components, and the specification logic …

The work at hand studies the possibilities and limitations of the use of finite automata in the
description of infinite structures. An automatic presentation of a countable structure consists …

Two player games are a standard model of reactive computation, where eg one player is the
controller and the other is the environment. A game is won by a player if she has a winning …

We study the problem of computing the transitive closure of tree-automatic (binary) relations,
which are represented by tree automata. Such relations include classes of infinite systems …

Abstract An Active Context-Free Game is a game with two players (ROMEO and JULIET) on
strings over a finite alphabet. In each move, JULIET selects a position of the current word …