Moment-based analysis of Bayesian network properties

DOI10.1016/j.tcs.2021.12.021OpenAlexW4200419269WikidataQ124212471 ScholiaQ124212471MaRDI QIDQ2072070

Miroslav Stankovič, Laura Kovács, Ezio Bartocci

Publication date: 1 February 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.12.021

zbMATH Keywords

Bayesian networkslinear recurrencesstatistical momentsinvariant generation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• PRISM
• MRMC
• Church
• Storm
• MIM
• Pyro
• Figaro

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A probability perspective
• Approximating probabilistic inference in Bayesian belief networks is NP- hard
• Runtime analysis of probabilistic programs with unbounded recursion
• A probabilistic PDL
• Semantics of probabilistic programs
• Counterexample-guided polynomial loop invariant generation by Lagrange interpolation
• Analysis of Bayesian networks via prob-solvable loops
• Automated termination analysis of polynomial probabilistic programs
• How long, O Bayesian network, will I sample thee? A program analysis perspective on expected sampling times
• Importance sampling algorithms for Bayesian networks: principles and performance
• The computational complexity of probabilistic inference using Bayesian belief networks
• Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs
• Probabilistic Termination
• Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops
• A Tutorial on Learning with Bayesian Networks
• Guarded commands, nondeterminacy and formal derivation of programs
• Synthesizing Probabilistic Invariants via Doob’s Decomposition
• Abstraction, Refinement and Proof for Probabilistic Systems
• Linear-Invariant Generation for Probabilistic Programs:
• Finding Polynomial Loop Invariants for Probabilistic Programs
• FM 2005: Formal Methods