Data-driven Abstractions with Probabilistic Guarantees for Linear PETC Systems
More Info
expand_more
expand_more
Abstract
We employ the scenario approach to compute probably approximately correct (PAC) bounds on the average inter-sample time (AIST) generated by an unknown PETC system, based on a finite number of samples. We extend the scenario optimisation to multiclass SVM algorithms in order to construct a PAC map between the concrete state-space and the inter-sample times. We then build a traffic model applying an l-complete relation and find, in the underlying graph, the cycles of minimum and maximum average weight: these provide lower and upper bounds on the AIST. Numerical benchmarks show the practical applicability of our method, which is compared against model-based state-of-the-art tools.
Files
Data_Driven_Abstractions_With_... (.pdf)
(.pdf | 0.778 Mb)
- Embargo expired in 24-12-2022