Eager Markov Chains: Eager Markov Chains
2006 (English)In: Proceedings of the fourth international symposium on Automated Technology for Verification and Analysis (ATVA), 2006, 24-38 p.Conference paper (Refereed)
We consider infinite-state discrete Markov chains which are eager:
the probability of avoiding a defined set of final states for more than n steps is bounded by some exponentially decreasing function f(n).
We prove that eager Markov chains include those induced by Probabilistic Lossy Channel Systems, Probabilistic Vector Addition Systems with States, and Noisy Turing Machines, and that the bounding function f(n) can be effectively constructed for them.
Furthermore, we study the problem of computing the expected reward (or cost) of runs until reaching the final states, where rewards are assigned to individual runs by computable reward functions.
For eager Markov chains, an effective path exploration scheme,
based on forward reachability analysis, can be used to approximate the expected reward up-to an arbitrarily small error.
Place, publisher, year, edition, pages
2006. 24-38 p.
IdentifiersURN: urn:nbn:se:uu:diva-19030ISBN: LNCS, Volume 4218OAI: oai:DiVA.org:uu-19030DiVA: diva2:46802