Regular (tree) model checking (RMC) is a promising generic method for formal verification of
infinite-state systems. It encodes configurations of systems as words or trees over a suitable …

This paper provides a comprehensive summary of equivalence checking results for infinite-
state systems. References to the relevant papers will be updated continuously according to …

Regular model checking is the name of a family of techniques for analyzing infinite-state
systems in which states are represented by words, sets of states by finite automata, and …

Regular model checking is the name of a family of techniques for analyzing infinite-state
systems in which states are represented by words, sets of states by finite automata, and …

In this habilitation thesis, we discuss two complementary approaches to formal verification of
infinite-state systems—namely, the use cut-offs and automata-based symbolic model …

We use some recent techniques from process algebra to draw several conclusions about the
well studied class of ping-pong protocols introduced by Dolev and Yao. In particular we …

We establish a decidability boundary of the model checking problem for infinite-state
systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite …

We examine the problem whether a given weakly extended process rewrite system (wPRS)
contains a reachable state satisfying a given formula of Hennessy–Milner logic. We show …

Ground tree rewrite systems (GTRS) are a well-known treeextension of prefix-rewrite
systems on words (aka pushdown systems), where subtrees (instead of word prefixes) are …

We study safety verification for multithreaded programs with recursive parallelism (ie
unbounded thread creation and recursion) as well as unbounded integer variables. Since …