Reachability problem

Decidability and complexity boundaries, algorithmic solutions, and efficient heuristics are all important aspects to be considered in this context.

Algorithmic solutions are often based on different combinations of exploration strategies, symbolic manipulations of sets of states, decomposition properties, or reduction to linear programming problems, and they often benefit from approximations, abstractions, accelerations and extrapolation heuristics.

[7][8] In 2022 reachability in vector addition systems was shown to be Ackermann-complete and therefore a nonelementary problem.

[9][8] The International Conference on Reachability Problems series, previously known as Workshop on Reachability Problems, is an annual academic conference which 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.