Overview

Reachability analysis studies which states a system can reach over time, and whether it can reach a goal while avoiding unsafe states. Researchers use methods such as Hamilton–Jacobi equations, interval and zonotope set propagation, symbolic model checking, and reachability certificates to analyze dynamical systems, robots, games, and neural networks. Learning-based approaches approximate reachable sets or safety functions from data, sometimes adding probabilistic or formal guarantees, to support real-time planning and verification. A central challenge is scaling these methods to high-dimensional systems without making the results overly conservative or relying on inaccurate models.

Latest papers

91 papers13 papers in the last four weeks, down 7% on the four weeks before. 0.1% of all new papers.

Feb 5, 2024

Decidable Reasoning About Time in Finite-Domain Situation Calculus Theories

Representing time is crucial for cyber-physical systems and has been studied extensively in the situation calculus. The most commonly used approach represents time by adding a real-valued function time(a)\mathit{time}(a) that attaches a time point to each action and consequently to each situation. We show that in this approach, checking whether there is a reachable situation that satisfies a given formula is undecidable, even when the domain contains only finitely many objects. We present an alternative approach based on well-established results from timed automata theory by introducing clocks as real-valued fluents with restricted successor state axioms and comparison operators. With this restriction, we can show that the reachability problem for finite-domain basic action theories is decidable. Finally, we apply our results to Golog program realization by presenting a decidable procedure for determining an action sequence that is a successful execution of a given program.