## Files in this item

FilesDescriptionFormat

application/pdf

mdptransdist.pdf (404Kb)
MDP_TRANS_DISTPDF

## Description

 Title: Reasoning About MDPs as Transformers of Probability Distributions Author(s): Korthikanti, Vijay Anand; Viswanathan, Mahesh; Kwon, YoungMin; Agha, Gul A. Subject(s): Markov Decision Processes Probability Distributions Semantics Model Checking Abstract: We consider Markov Decision Processes (MDPs) as transformers on probability distributions, where with respect to a scheduler that resolves nondeterminism, the MDP can be seen as exhibiting a behavior that is a sequence of probability distributions. Defining propositions using linear inequalities, one can reason about executions over the space of probability distributions. In this framework, one can analyze properties that cannot be expressed in logics like PCTL$^*$, such as expressing bounds on transient rewards and expected values of random variables, and comparing the probability of being in one set of states at a given time with that of being in another set of states. We show that model checking MDPs with this semantics against $\omega$-regular properties is in general undecidable. We then identify special classes of propositions and schedulers with respect to which the model checking problem becomes decidable. We demonstrate the potential usefulness of our results through an example. Issue Date: 2010 Type: Text URI: http://hdl.handle.net/2142/16515 Publication Status: published or submitted for publication Date Available in IDEALS: 2010-06-26
﻿