BeClaude
Research2026-05-12

Automated Approach for Solving Infinite-state Polynomial Reachability Games

Source: Arxiv CS.AI

arXiv:2605.10169v1 Announce Type: new Abstract: Reachability games are two-player games played on a graph, where the objective of $\texttt{REACH}$ player is to reach the target set whereas the objective of $\texttt{SAFE}$ player is to stay away from the target set. Reachability games have important...

arxivpapers