SwePub
Sök i LIBRIS databas

  Extended search

onr:"swepub:oai:DiVA.org:kth-309863"
 

Search: onr:"swepub:oai:DiVA.org:kth-309863" > Formal safety verif...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Formal safety verification of unknown continuous-time systems : A data-driven approach

Lavaei, A. (author)
Nejati, A. (author)
Jagtap, Pushpak (author)
KTH,Reglerteknik
show more...
Zamani, M. (author)
show less...
 (creator_code:org_t)
2021-05-19
2021
English.
In: HSCC 2021 - Proceedings of the 24th International Conference on Hybrid Systems. - New York, NY, USA : Association for Computing Machinery (ACM).
  • Conference paper (peer-reviewed)
Abstract Subject headings
Close  
  • This work studies formal verification of continuous-time continuous-space systems with unknown dynamics against safety specifications. The proposed framework is based on a data-driven construction of barrier certificates using which the safety of unknown systems is verified via a finite set of data collected from trajectories of systems with a priori guaranteed confidence. In the proposed scheme, we first cast the original safety problem as a robust convex program (RCP). Since the unknown model appears in one of the constraints of the proposed RCP, we provide the scenario convex program (SCP) corresponding to the original RCP by collecting finite numbers of data from systems' evolutions. We then establish a probabilistic closeness between the optimal value of SCP and that of RCP. Accordingly, we formally quantify the safety guarantee of unknown systems based on the number of data and the required level of safety confidence. Motivations. In the past few years, formal methods have become a promising approach to analyze dynamical systems against high-level logic properties, e.g., those expressed as linear temporal logic (LTL) formulae, in a reliable way. In this regard, barrier certificates, as a discretization-free approach, have received significant attention as a useful tool for formal analysis of complex dynamical systems. In particular, barrier certificates are Lyapunov-like functions defined over the state space of systems subjected to a set of inequalities on both the function itself and its time derivative along the flow of the system. The existence of such a function provides a formal certificate for the safety of the system [1, 2]. To employ the proposed approaches in the setting of barrier certificates, one needs to know precise models of dynamical systems and, hence, those approaches are not applicable where the model is unknown. Although there are some identification techniques in the relevant literature to first learn the model and then provide the analysis framework (e.g., [3, 4]), acquiring an accurate model for complex systems is always very challenging, time-consuming, and expensive. This crucial challenge motivated us to employ data-driven approaches and directly construct barrier certificates via data collected from trajectories of unknown systems.

Subject headings

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Reglerteknik (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Control Engineering (hsv//eng)

Keyword

barrier certificates
data-driven optimization
formal safety verification
unknown continuous-time systems

Publication and Content Type

ref (subject category)
kon (subject category)

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Find more in SwePub

By the author/editor
Lavaei, A.
Nejati, A.
Jagtap, Pushpak
Zamani, M.
About the subject
ENGINEERING AND TECHNOLOGY
ENGINEERING AND ...
and Electrical Engin ...
and Control Engineer ...
Articles in the publication
By the university
Royal Institute of Technology

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view