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 application/pdf
.
Almost-Sure Model-Checking of Reactive Timed Automata
2012
2012 Ninth International Conference on Quantitative Evaluation of Systems
We consider the model of stochastic timed automata, a model in which both delays and discrete choices are made probabilistically. We are interested in the almost-sure modelchecking problem, which asks whether the automaton satisfies a given property with probability 1. While this problem was shown decidable for single-clock automata few years ago, it was also proven that the algorithm for this decidability result could not be used for general timed automata. In this paper we describe the
doi:10.1109/qest.2012.10
dblp:conf/qest/BouyerBJM12
fatcat:h6rcr36g2jfyxiiisk4wylzbmi