Moment-based analysis of Bayesian network properties

DOI10.1016/J.TCS.2021.12.021MaRDI QIDQ2072070zbMATH OpenOpenAlexWikidataFDO

Authors Miroslav Stankovič, Ezio Bartocci, Laura Kovács

Publication date 1 February 2022

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

Copyright license Creative Commons Attribution 4.0 International

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)

Cites work

• scientific article; zbMATH DE number 3673370 (Why is no real title available?)
• scientific article; zbMATH DE number 148970 (Why is no real title available?)
• scientific article; zbMATH DE number 4121482 (Why is no real title available?)
• scientific article; zbMATH DE number 1832220 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• A Tutorial on Learning with Bayesian Networks
• A probabilistic PDL
• A probability perspective
• Abstraction, Refinement and Proof for Probabilistic Systems
• Analysis of Bayesian networks via prob-solvable loops
• Approximating probabilistic inference in Bayesian belief networks is NP- hard
• Automated termination analysis of polynomial probabilistic programs
• Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops
• Counterexample-guided polynomial loop invariant generation by Lagrange interpolation
• FM 2005: Formal Methods
• Finding polynomial loop invariants for probabilistic programs
• Guarded commands, nondeterminacy and formal derivation of 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
• Linear-invariant generation for probabilistic programs: automated support for proof-based methods
• Probabilistic graphical models.
• Probabilistic methods for financial and marketing informatics
• Probabilistic termination: soundness, completeness, and compositionality
• Runtime analysis of probabilistic programs with unbounded recursion
• Semantics of probabilistic programs
• Synthesizing Probabilistic Invariants via Doob’s Decomposition
• The computational complexity of probabilistic inference using Bayesian belief networks
• Weakest precondition reasoning for expected run-times of probabilistic programs

Cited in

(3)

• Automatically finding the right probabilities in Bayesian networks
• Synergy-incorporated Bayesian Petri net: a method for mining ``and/or relation and synergy effect with application in probabilistic reasoning
• Exact and approximate moment derivation for probabilistic loops with non-polynomial assignments

Describes a project that uses

Uses Software

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

This page was built for publication: Moment-based analysis of Bayesian network properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2072070)