Abstract. Refinement plays a crucial role in "top-down" styles of verification, such as the refinement calculus, but for probabilistic systems proof of refinement is a pa...
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...
In this work, probabilistic reachability over a finite horizon is investigated for a class of discrete time stochastic hybrid systems with control inputs. A suitable embedding of ...
Alessandro Abate, Maria Prandini, John Lygeros, Sh...
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
Aaron D. Jaggard, Catherine Meadows, Michael Mislo...
Probabilistic B (pB) [2, 8] extends classical B [7] to incorporate probabilistic updates together with the specification of quantitative safety properties. As for classical B, prob...