Automated and Formal Synthesis of Neural Barrier Certificates for Dynamical Models
Not on the map. Why?
Abstract (arXiv)
We introduce an automated, formal, counterexample-based approach to synthesise Barrier Certificates (BC) for the safety verification of continuous and hybrid dynamical models. The approach is underpinned by an inductive framework: this is structured as a sequential loop between a learner, which manipulates a candidate BC structured as a neural network, and a sound verifier, which either certifies the candidate's validity or generates counter-examples to further guide the learner. We compare the approach against state-of-the-art techniques, over polynomial and non-polynomial dynamical models: the outcomes show that we can synthesise sound BCs up to two orders of magnitude faster, with in particular a stark speedup on the verification engine (up to five orders less), whilst needing a far smaller data set (up to three orders less) for the learning part. Beyond improvements over the state of the art, we further challenge the new approach on a hybrid dynamical model and on larger-dimensional models, and showcase the numerical robustness of our algorithms and codebase.
Key facts. Cited by 3 papers in the map (data through 13 Oct 2026). First posted on arXiv 7 Jul 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 0; 2024: 1.
3 papers.
- 2021Neural Termination Analysiscited by 16
- 2021Infinite Time Horizon Safety of Bayesian Neural Networkscited by 13
- 2024Safe Reach Set Computation via Neural Barrier Certificatescited by 5
- 2024Safe Reach Set Computation via Neural Barrier Certificates29 Apr 2024
- 2021Infinite Time Horizon Safety of Bayesian Neural Networks4 Nov 2021
- 2021Neural Termination Analysis7 Feb 2021