|[28/8] A Characterisation of Meaningful Schedulers for Continuous-Time Markov Decision Processes|
por Nicolas Wolovick
Continuous-time Markov decision process are an important variant of labelled transition systems having nondeterminism through labels and stochasticity through exponential ﬁre-time distributions. Nondeterministic choices are resolved using the notion of a scheduler. In this paper we charac- terize the class of measurable schedulers, which is the most general one, and show how a measurable scheduler induces a unique probability measure on the sigma-algebra of inﬁnite paths. We then give evidence that for particu- lar reachability properties it is sufficient to consider a subset of measurable schedulers. Having analyzed schedulers and their induced probability mea- sures we ﬁnally show that each probability measure on the sigma-algebra of inﬁnite paths is indeed induced by a measurable scheduler which proves that this class is complete.
trabajo conjunto con Sven Johr (Universität des Saarlandes)
|< Anterior||Siguiente >|