Reachability problem

Reachability is a fundamental problem in the context of many models and abstractions which describe various computational processes. Analysis of the computational traces and predictability questions for such models can be formalized in terms of different reachability questions.

In general reachability problem can be formulated as follows:

Given a computational (potentially infinite state) system with a set of allowed rules or transformations, decide whether a certain state of a system is reachable from a given initial state of the system.

The variants of such reachability problem may be appear as a result of additional constraints on the initial or final states, specific requirement for a reachability paths as well as for iterative reachability or changing the questions i nto analysis of winning strategies in infinite games or unavoidability of some dynamics.

Workshop on Reachability Problems

The Workshop on Reachability Problems series gathers together researchers from diverse disciplines and backgrounds interested in reachability problems that appear in algebraic structures, computational models, hybrid systems, infinite games, logic and verification. The workshop tries to fill the gap between results obtained in different fields but sharing common mathematical structure or conceptual difficulties.