Probabilistic hybrid systems verification via SMT and Monte Carlo techniques

12Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We develop numerically rigorous Monte Carlo approaches for computing probabilistic reachability in hybrid systems subject to random and nondeterministic parameters. Instead of standard simulation we use δ-complete SMT procedures, which enable formal reasoning for nonlinear systems up to a user-definable numeric precision. Monte Carlo approaches for probability estimation assume that sampling is possible for the real system at hand. However, when using δ-complete simulation one instead samples from an overapproximation of the real random variable. In this paper, we introduce a Monte Carlo-SMT approach for computing probabilistic reachability confidence intervals that are both statistically and numerically rigorous. We apply our technique to hybrid systems involving nonlinear differential equations.

Cite

CITATION STYLE

APA

Shmarov, F., & Zulian, P. (2016). Probabilistic hybrid systems verification via SMT and Monte Carlo techniques. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10028 LNCS, pp. 152–168). Springer Verlag. https://doi.org/10.1007/978-3-319-49052-6_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free