Quantitative automata model checking of autonomous stochastic hybrid systems

Alessandro Abate, Joost-Pieter Katoen, Alexandru Mereacre
2011 Proceedings of the 14th international conference on Hybrid systems: computation and control - HSCC '11  
This paper considers the quantitative verification of discretetime stochastic hybrid systems (DTSHS) against linear time objectives. The central question is to determine the likelihood of all the trajectories in a DTSHS that are accepted by an automaton on finite or infinite words. This verification covers regular and ω-regular properties, and thus comprises the linear temporal logic LTL. This work shows that these quantitative verification problems can be reduced to computing reachability
more » ... bilities over the product of an automaton and the DTSHS under study. The computation of reachability probabilities can be performed in a backwardrecursive manner, and quantitatively approximated by procedures over discrete-time Markov chains. A case study shows the feasibility of the approach.
doi:10.1145/1967701.1967715 dblp:conf/hybrid/AbateKM11 fatcat:c2tgbcbjtvfjpmdy2i3jzqph6e