In this paper we propose a novel methodology to construct, given trajectories measured from a dynamical system, a finite abstraction by means of a transition system. We prove that our abstraction is a simulation of the original dynamical system, providing quantified probabilistic guarantees derived using the scenario approach. We test our methodology on a benchmark on hybrid systems showing that it strongly reduces the cardinality of the abstraction states with respect to a uniform grid, and is thus very promising for handling abstractions of large dimensional systems.
Data driven finite abstractions by simulation relations with probabilistic guarantees using regression trees
D'Innocenzo, Alessandro;Rehman, Khalil Ul;Lun, Yuriy Zacchia
2025-01-01
Abstract
In this paper we propose a novel methodology to construct, given trajectories measured from a dynamical system, a finite abstraction by means of a transition system. We prove that our abstraction is a simulation of the original dynamical system, providing quantified probabilistic guarantees derived using the scenario approach. We test our methodology on a benchmark on hybrid systems showing that it strongly reduces the cardinality of the abstraction states with respect to a uniform grid, and is thus very promising for handling abstractions of large dimensional systems.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
2025_IEEE_CDC___Data_driven_finite_abstractions_via_regression_trees_and_simulation_relations_with_probabilistic_guarantees.pdf
solo utenti autorizzati
Tipologia:
Documento in Pre-print
Licenza:
Copyright dell'editore
Dimensione
319.49 kB
Formato
Adobe PDF
|
319.49 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


