Best Probabilistic Transformers

14 years 3 months ago
Best Probabilistic Transformers
This paper investigates relative precision and optimality of analyses for concurrent probabilistic systems. Aiming at the problem at the heart of probabilistic model checking ? computing the probability of reaching a particular set of states ? we leverage the theory of abstract intion. With a focus on predicate abstraction, we develop the first interpretation framework for Markov decision processes which admits to compute both lower and upper bounds on reachability probabilities. Further, we describe how to compute and approximate such ions using abstraction refinement and give experimental results.
Björn Wachter, Lijun Zhang
Added 05 Mar 2010
Updated 08 Mar 2010
Type Conference
Year 2010
Authors Björn Wachter, Lijun Zhang
Comments (0)