Model Checking Finite-Horizon Markov Chains with Probabilistic Inference

  title={Model Checking Finite-Horizon Markov Chains with Probabilistic Inference},
  author={Steven Holtzen and Sebastian Junges and Marcell Vazquez-Chanlatte and Todd D. Millstein and Sanjit A. Seshia and Guy Van den Broeck},
We revisit the symbolic verification of Markov chains with respect to finite horizon reachability properties. The prevalent approach iteratively computes step-bounded state reachability probabilities. By contrast, recent advances in probabilistic inference suggest symbolically representing all horizon-length paths through the Markov chain. We ask whether this perspective advances the state-of-the-art in probabilistic model checking. First, we formally describe both approaches in order to… 
Parameter Synthesis in Markov Models: A Gentle Survey
The main ideas underlying state-of-the-art algorithms that established an impressive leap over the last decade enabling the fully automated analysis of models with millions of states and thousands of parameters are described.
Probabilistic Program Verification via Inductive Synthesis of Inductive Invariants
An inductive synthesis approach for proving quantitative reachability properties by proving inductive invariants on source-code level by beating state-of-the-art model checkers on some benchmarks and often outperforming monolithic alternatives.
This is the Moment for Probabilistic Loops
A novel static analysis technique to derive higher moments for program variables of a large class of probabilistic loops with complex control flow, polynomial assignments, symbolic constants, circular dependencies among variables, and potentially uncountable state spaces is presented.
flip-hoisting: Exploiting Repeated Parameters in Discrete Probabilistic Programs
Probabilistic programming is emerging as a popular and effective means of probabilistic modeling and an alternative to probabilistic graphical models. Probabilistic programs provide greater


The Probabilistic Model Checker Storm
The main features of Storm are reported and how to effectively use them are explained and an empirical evaluation of different configurations of Storm on the QComp 2019 benchmark set is presented.
On probabilistic inference by weighted model counting
Scaling exact inference for discrete probabilistic programs
A domain-specific probabilistic programming language called Dice is developed that features a new approach to exact discrete Probabilistic program inference, and a new reduction from discrete probabilism programs to weighted model counting (WMC).
Inference and learning in probabilistic logic programs using weighted Boolean formulas
The results show that the inference algorithms improve upon the state of the art in probabilistic logic programming, and that it is indeed possible to learn the parameters of a probabilist logic program from interpretations.
Fine-Tuning the Odds in Bayesian Networks
Various new analysis techniques for Bayes networks in which conditional probability tables (CPTs) may contain symbolic variables are proposed to exploit scalable and powerful techniques for synthesis problems in parametric Markov chains.
A Near-Linear-Time Algorithm for Weak Bisimilarity on Markov Chains
The time bound for calculating the weak/branching bisimulation minimisation minimisation quotient on state-labelled discrete-time Markov chains is improved from O(mn) to an expected-time O(m log4 n), where n is the number of states and m thenumber of transitions.
On Correctness, Precision, and Performance in Quantitative Verification - QComp 2020 Competition Report
This paper surveys the precision guarantees—ranging from exact rational results to statistical confidence statements—offered by the nine participating tools and reports on the experimental evaluation of these trade-offs performed in QComp 2020: the second friendly competition of tools for the analysis of quantitative formal models.
Bayesian Inference by Symbolic Model Checking
A simple translation from Bayesian networks into tree-like Markov chains such that inference can be reduced to computing reachability probabilities using probabilistic sentential decision diagrams and vtrees, a scalable symbolic technique in AI inference tools.
Bridging the Gap Between Probabilistic Model Checking and Probabilistic Planning: Survey, Compilations, and Empirical Comparison
The translation from Jani, an overarching input language for quantitative model checkers, into the probabilistic planning domain definition language (PPDDL), and vice versa from PPDDL into Jani are intended as a beginning to unite the two research branches.