129 citations · 368 across the 70 of their papers we have counts for
6 papers · 1 filter
Incremental Data-Driven Policy Synthesis via Game Abstractions
Irmak Sağlam, Mahdi Nazeri, Alessandro Abate +2
We address the synthesis of control policies for unknown discrete-time stochastic dynamical systems to satisfy temporal logic objectives. We present a data-driven, abstraction-base…
Sum-of-Squares Certificates for Almost-Sure Reachability of Stochastic Polynomial Systems
Arash Bahari Kordabad, Rupak Majumdar, Sadegh Soudjani
In this paper, we present a computational approach to certify almost sure reachability for discrete-time polynomial stochastic systems by turning drift--variant criteria into sum-o…
Formal Analysis of Metastable Failures in Software Systems
Peter Alvaro, Rebecca Isaacs, Rupak Majumdar +3
Many large-scale software systems demonstrate metastable failures. In this class of failures, a stressor such as a temporary spike in workload causes the system performance to drop…
Data-Driven Abstraction and Synthesis for Stochastic Systems with Unknown Dynamics
Mahdi Nazeri, Thom Badings, Anne-Kathrin Schmuck +2
We study the automated abstraction-based synthesis of correct-by-construction control policies for stochastic dynamical systems with unknown dynamics. Our approach is to learn an a…
On Certificates for Almost Sure Reachability in Stochastic Systems
Arash Bahari Kordabad, Rupak Majumdar, Harshit Jitendra Motwani +1
Almost sure reachability refers to the property of a stochastic system whereby, from any initial condition, the system state reaches a given target set with probability one. In thi…
Data-Driven Yet Formal Policy Synthesis for Stochastic Nonlinear Dynamical Systems
Mahdi Nazeri, Thom Badings, Sadegh Soudjani +1
The automated synthesis of control policies for stochastic dynamical systems presents significant challenges. A standard approach is to construct a finite-state abstraction of the…