Automatic Synthesis of Polynomial Probabilistic Invariants via Geometric Persistence
In this paper we present an algorithm for the automatic synthesis of polynomial invariants for probabilistic transition systems. Our approach is based on martingale theory. We construct invariants in the form of polynomials over program variables, which give rise to martingales. These polynomials are program invariants in the sense that their expected value upon termination is the same as their value at the start of the computation. By exploiting geometric persistence properties of the system, we show that suitable polynomials can be automatically inferred using sum-of-squares optimisation techniques.
Sun 7 Apr Times are displayed in time zone: (GMT+02:00) Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
|11:00 - 11:30|
Mathias Ruggaard PedersenAalborg University, Giorgio BacciAalborg University, Kim LarsenAalborg UniversityPre-print
|11:30 - 12:00|
|12:00 - 12:30|
Jan Olaf BlechAalto UniversityPre-print