Symbolic Approximation of the Bounded Reachability Probability in Large Markov Chains

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

Symbolic Approximation of the Bounded Reachability Probability in Large Markov Chains

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

Bar-Ilan University - The Alexander Kofkin Faculty of Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 language	American English
Title of host publication	11th International Conference, QEST
Editors	Gethin Norman, William Sanders
Publisher	Springer International Publishing
State	Published - 2014

Bibliographical note

Place of conference:Italy

Cite this

@inproceedings{8cf9afb396664cbfbdef015fadb9a7b8,

title = "Symbolic Approximation of the Bounded Reachability Probability in Large Markov Chains",

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.",

author = "Rabe, {Markus N.} and Wintersteiger, {Christoph M.} and Hillel Kugler and Boyan Yordanov and Youssef Hamadi",

note = "Place of conference:Italy",

year = "2014",

language = "American English",

editor = "Gethin Norman and William Sanders",

booktitle = "11th International Conference, QEST",

publisher = "Springer International Publishing",

}

Symbolic Approximation of the Bounded Reachability Probability in Large Markov Chains. / Rabe, Markus N.; Wintersteiger, Christoph M.; Kugler, Hillel et al.
11th International Conference, QEST. ed. / Gethin Norman; William Sanders. Springer International Publishing, 2014.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Symbolic Approximation of the Bounded Reachability Probability in Large Markov Chains

AU - Rabe, Markus N.

AU - Wintersteiger, Christoph M.

AU - Kugler, Hillel

AU - Yordanov, Boyan

AU - Hamadi, Youssef

N1 - Place of conference:Italy

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

UR - https://scholar.google.co.il/scholar?q=Symbolic+Approximation+of+the+Bounded+Reachability+Probability+in+Large+Markov+Chains&btnG=&hl=en&as_sdt=0%2C5

M3 - Conference contribution

BT - 11th International Conference, QEST

A2 - Norman, Gethin

A2 - Sanders, William

PB - Springer International Publishing

ER -

Symbolic Approximation of the Bounded Reachability Probability in Large Markov Chains

Abstract

Bibliographical note

Other files and links

Fingerprint

Cite this