PAC Model Checking of Black-Box Continuous-Time Dynamical Systems
Not on the map. Why?
Abstract (arXiv)
In this paper we present a novel model checking approach to finite-time safety verification of black-box continuous-time dynamical systems within the framework of probably approximately correct (PAC) learning. The black-box dynamical systems are the ones, for which no model is given but whose states changing continuously through time within a finite time interval can be observed at some discrete time instants for a given input. The new model checking approach is termed as PAC model checking due to incorporation of learned models with correctness guarantees expressed using the terms error probability and confidence. Based on the error probability and confidence level, our approach provides statistically formal guarantees that the time-evolving trajectories of the black-box dynamical system over finite time horizons fall within the range of the learned model plus a bounded interval, contributing to insights on the reachability of the black-box system and thus on the satisfiability of its safety requirements. The learned model together with the bounded interval is obtained by scenario optimization, which boils down to a linear programming problem. Three examples demonstrate the performance of our approach.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 17 Jul 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 2; 2023: 2; 2024: 0; 2025: 0; 2026: 2.
8 papers.
- 2021Learning Density Distribution of Reachable States for Autonomous Systemscited by 11
- 2023TrajPAC: Towards Robustness Verification of Pedestrian Trajectory Prediction Modelscited by 8
- 2021Formal Verification of Unknown Dynamical Systems via Gaussian Process Regressioncited by 5
- 2023Bridging Dimensions: Confident Reachability for High-Dimensional Controllerscited by 5
- 2026GenCtrl -- A Formal Controllability Toolkit for Generative Modelscited by 2
- 2022Case Studies for Computing Density of Reachable States for Safe Autonomous Motion Planningcited by 1
- 2022Taming Reachability Analysis of DNN-Controlled Systems via Abstraction-Based Trainingcited by 0
- 2026PAC Approximation and DIRECT Optimization for Parametric Markov Modelscited by 0
- 2026PAC Approximation and DIRECT Optimization for Parametric Markov Models3 Aug 2026
- 2026GenCtrl -- A Formal Controllability Toolkit for Generative Models9 Jan 2026
- 2023Bridging Dimensions: Confident Reachability for High-Dimensional Controllers8 Nov 2023
- 2023TrajPAC: Towards Robustness Verification of Pedestrian Trajectory Prediction Models11 Aug 2023
- 2022Taming Reachability Analysis of DNN-Controlled Systems via Abstraction-Based Training21 Nov 2022
- 2022Case Studies for Computing Density of Reachable States for Safe Autonomous Motion Planning16 Sep 2022
- 2021Formal Verification of Unknown Dynamical Systems via Gaussian Process Regression31 Dec 2021
- 2021Learning Density Distribution of Reachable States for Autonomous Systems14 Sep 2021