Safety of stochastic systems : an analytic and computational approach

Tools

Wisniewski, Rafal and Bujorianu, Luminita (2021) Safety of stochastic systems : an analytic and computational approach. Automatica, 133. 109839. ISSN 0005-1098 (https://doi.org/10.1016/j.automatica.2021.109839)

[thumbnail of Wisniewski-Bujorianu-Automatica-2021-Safety-of-stochastic-systems]
Preview
 Text. Filename: Wisniewski_Bujorianu_Automatica_2021_Safety_of_stochastic_systems.pdf
Accepted Author Manuscript
License: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 logo
Download (1MB)| Preview

Abstract

We refine the concept of stochastic reach avoidance for a general class of Markov processes introducing a threshold of p for the reaching probability. This new problem is called p-safety, and it aims to ensure that the given process reaches a forbidden set before leaving its ‘working’ state space with a probability of less than p. In the situation when an initial probability measure characterizes the initial states, a variant of p-safety is put forward. We call this form of safety weak p-safety. In this work, we characterize both p-safety and weak p-safety and show how to compute them. We employ semi-definite programming to compute p-safety and linear programming to compute weak p-safety. To get to this point, we use certificates of positivity of polynomials translated into the sum of squares and the Bernstein forms.

CORE (COnnecting REpositories)