Symbolic approximation of the bounded reachability probability in large Markov chains

Markus N. Rabe, Christoph M. Wintersteiger, Hillel Kugler, Boyan Yordanov, Youssef Hamadi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Scopus citations

Abstract

We present a novel technique to analyze the bounded reachability probability problem for large Markov chains. The essential idea is to incrementally search for sets of paths that lead to the goal region and to choose the sets in a way that allows us to easily determine the probability mass they represent. To effectively analyze the system dynamics using an SMT solver, we employ a finite-precision abstraction on the Markov chain and a custom quantifier elimination strategy. Through experimental evaluation on PRISM benchmark models we demonstrate the feasibility of the approach on models that are out of reach for previous methods.

Original languageEnglish
Title of host publicationQuantitative Evaluation of Systems - 11th International Conference, QEST 2014, Proceedings
PublisherSpringer Verlag
Pages388-403
Number of pages16
ISBN (Print)9783319106953
DOIs
StatePublished - 2014
Externally publishedYes
Event11th International Conference on Quantitative Evaluation of Systems, QEST 2014 - Florence, Italy
Duration: 8 Sep 201410 Sep 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8657 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th International Conference on Quantitative Evaluation of Systems, QEST 2014
Country/TerritoryItaly
CityFlorence
Period8/09/1410/09/14

Fingerprint

Dive into the research topics of 'Symbolic approximation of the bounded reachability probability in large Markov chains'. Together they form a unique fingerprint.

Cite this