Log In Sign Up

Verifying Reachability Properties in Markov Chains via Incremental Induction

by   Elizabeth Polgreen, et al.

There is a scalability gap between probabilistic and non-probabilistic verification. Probabilistic model checking tools are based either on explicit engines or on (Multi-Terminal) Binary Decision Diagrams. These structures are complemented in areas of non-probabilistic verification by more scalable techniques, such as IC3. We present a symbolic probabilistic model checking algorithm based on IC3-like incremental construction of inductive clauses to partition the state space, interleaved with incremental construction of a system of linear inequalities. This paper compares our implementation to standard quantitative verification alternatives: our experiments show that our algorithm is a step to more scalable symbolic verification of rare events in finite-state Markov chains.


page 1

page 2

page 3

page 4


Bayesian Inference by Symbolic Model Checking

This paper applies probabilistic model checking techniques for discrete ...

Scalable Verification of Probabilistic Networks

This paper presents McNetKAT, a scalable tool for verifying probabilisti...

Model Checking Finite-Horizon Markov Chains with Probabilistic Inference

We revisit the symbolic verification of Markov chains with respect to fi...

Latticed k-Induction with an Application to Probabilistic Programs

We revisit two well-established verification techniques, k-induction and...

Iterative Variable Reordering: Taming Huge System Families

For the verification of systems using model-checking techniques, symboli...

Incremental Verification of Parametric and Reconfigurable Markov Chains

The analysis of parametrised systems is a growing field in verification,...

Incremental Observer Reduction Applied to Opacity Verification and Synthesis

With the proliferation of communication networks and mobile devices, the...