🤖 AI Summary
Existing verification approaches for reach-avoid properties in neural feedback systems predominantly rely on forward reachability analysis, which struggles to balance precision and scalability. This work proposes a unified verification framework that synergistically integrates forward and backward analysis. For the first time, it enables efficient computation of both upper and lower approximations of backward reachable sets and seamlessly combines them with forward methods, thereby overcoming the limitations inherent in traditional unidirectional verification. The proposed approach significantly enhances both completeness and scalability of verification, allowing for more precise treatment of reach-avoid properties in complex neural feedback systems while rigorously guaranteeing safety.
📝 Abstract
Forward reachability analysis is the predominant approach for verifying reach-avoid properties in neural feedback systems (dynamical systems controlled by neural networks). This dominance stems from the limited scalability of existing backward reachability methods. In this work, we introduce new algorithms that compute both over- and under-approximations of backward reachable sets for such systems. We further integrate these backward algorithms with established forward analysis techniques to yield a unified verification framework for neural feedback systems.