Probabilistic Reachability and Invariance Computation of Stochastic Systems using Linear Programming
Not on the map. Why?
Abstract (arXiv)
We consider the safety evaluation of discrete time, stochastic systems over a finite horizon. Therefore, we discuss and link probabilistic invariance with reachability as well as reach-avoid problems. We show how to efficiently compute these quantities using dynamic and linear programming.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 14 Nov 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 1.
1 paper.