Data-driven Abstractions with Probabilistic Guarantees for Linear PETC Systems

Journal article (2022)

Authors

A. Peruffo Team Manuel Mazo Jr - Mechanical, Maritime and Materials Engineering

M. Mazo Team Manuel Mazo Jr - Mechanical, Maritime and Materials Engineering

Research Group

Team Manuel Mazo Jr (Mechanical, Maritime and Materials Engineering) (TU Delft)

DOI: https://doi.org/10.1109/LCSYS.2022.3186187

Stability analysis Automata Computational modeling Support vector machines Probabilistic logic Behavioral sciences Discrete event systems Picture archiving and communication systems Statistical learning

More Info

expand_more

To reference this document use:

http://resolver.tudelft.nl/uuid:35492245-541e-4334-b402-31b06972df80

Published Date

2022

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Mechanical, Maritime and Materials Engineering

Department

Delft Center for Systems and Control

Research Group

Team Manuel Mazo Jr

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