Download PDFOpen PDF in browserVerification of Stochastic Systems by Stochastic Satisfiability Modulo Theories with Continuous Domain9 pages•Published: December 18, 2015AbstractStochastic Satisfiability Modulo Theories (SSMT) is a quantitative exten-sion of classical Satisfiability Modulo Theories (SMT) inspired by stochastic logics. It extends SMT by the usual as well as randomized quantifiers, fa- cilitating capture of stochastic game properties in the logic, like reachability analysis of hybrid-state Markov decision processes. Solving for SSMT for- mulae with quantification over finite and thus discrete domain has been ad- dressed by Tino Teige et al. In our work, we extend their work to SSMT over continuous quantifier domains (CSSMT) in order to enable capture of, e.g., continuous disturbances and uncertainty in hybrid systems. We extend the semantics of SSMT and introduce a corresponding solving procedure. A discussion regarding to reachability analysis is given to demonstrate applica- bility of our framework to reachability problems in hybrid systems. Keyphrases: constraint solving, hybrid system, reachability analysis, stochastic satisfiability modulo theory In: Sergiy Bogomolov and Ashish Tiwari (editors). Symbolic and Numerical Methods for Reachability Analysis, 1st International Workshop, SNR 2015, vol 37, pages 2-10.
|