Shepherding Hordes of Markov Chains

02/15/2019
by   Milan Ceska, et al.
0

This paper considers large families of Markov chains (MCs) that are defined over a set of parameters with finite discrete domains. Such families occur in software product lines, planning under partial observability, and sketching of probabilistic programs. Simple questions, like `does at least one family member satisfy a property?', are NP-hard. We tackle two problems: distinguish family members that satisfy a given quantitative property from those that do not, and determine a family member that satisfies the property optimally, i.e., with the highest probability or reward. We show that combining two well-known techniques, MDP model checking and abstraction refinement, mitigates the computational complexity. Experiments on a broad set of benchmarks show that in many situations, our approach is able to handle families of millions of MCs, providing superior scalability compared to existing solutions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/21/2021

Model Sketching by Abstraction Refinement for Lifted Model Checking (Extended Version)

In this work, we show how the use of verification and analysis technique...
research
03/08/2021

Robust Model Checking with Imprecise Markov Reward Models

In recent years probabilistic model checking has become an important are...
research
05/27/2021

Model Repair Revamped: On the Automated Synthesis of Markov Chains

This paper outlines two approaches|based on counterexample-guided abstra...
research
08/18/2021

Witnessing subsystems for probabilistic systems with low tree width

A standard way of justifying that a certain probabilistic property holds...
research
08/21/2023

New copula families and mixing properties

We characterize absolutely continuous symmetric copulas with square inte...
research
04/28/2021

Probabilistic causes in Markov chains

The paper studies a probabilistic notion of causes in Markov chains that...
research
08/28/2021

Embedded (4, 5) pairs of explicit 7-stage Runge-Kutta methods with FSAL property

Five 4-dimensional families of embedded (4, 5) pairs of explicit 7-stage...

Please sign up or login with your details

Forgot password? Click here to reset