A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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 reachabilitydoi:10.1145/1967701.1967715 dblp:conf/hybrid/AbateKM11 fatcat:c2tgbcbjtvfjpmdy2i3jzqph6e