Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Probabilistic Model Checking for Continuous Time Markov Chains via Sequential Bayesian Inference (1711.01863v2)

Published 6 Nov 2017 in cs.LO

Abstract: Probabilistic model checking for systems with large or unbounded state space is a challenging computational problem in formal modelling and its applications. Numerical algorithms require an explicit representation of the state space, while statistical approaches require a large number of samples to estimate the desired properties with high confidence. Here, we show how model checking of time-bounded path properties can be recast exactly as a Bayesian inference problem. In this novel formulation the problem can be efficiently approximated using techniques from machine learning. Our approach is inspired by a recent result in statistical physics which derived closed form differential equations for the first-passage time distribution of stochastic processes. We show on a number of non-trivial case studies that our method achieves both high accuracy and significant computational gains compared to statistical model checking.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Dimitrios Milios (12 papers)
  2. Guido Sanguinetti (41 papers)
  3. David Schnoerr (10 papers)
Citations (9)

Summary

We haven't generated a summary for this paper yet.