Probabilistic verification and approximation

DOI10.1016/J.APAL.2007.11.006MaRDI QIDQ2478551zbMATH OpenOpenAlexFDO

Authors Richard Lassaigne, Sylvain Peyronnet

Publication date 28 March 2008

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apal.2007.11.006

zbMATH Keywords

probabilistic verificationrandomized approximation algorithms

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Probabilistic verification
• Probabilistic verification of proofs
• The complexity of probabilistic verification
• Verification of Probabilistic Programs
• Probabilistic verification of proofs in calculuses
• Distribution, approximation and probabilistic model checking
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Verified computation with probabilities
• Probabilistic verification of Boolean functions

Cites work

• scientific article; zbMATH DE number 420886 (Why is no real title available?)
• scientific article; zbMATH DE number 1538049 (Why is no real title available?)
• scientific article; zbMATH DE number 1905115 (Why is no real title available?)
• scientific article; zbMATH DE number 2090714 (Why is no real title available?)
• A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
• A logic for reasoning about time and reliability
• An Optimal Algorithm for Monte Carlo Estimation
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Computer Aided Verification
• Distribution, approximation and probabilistic model checking
• Evaluating complex MAC protocols for sensor networks with APMC
• Markov Chains
• Model checking of probabilistic and nondeterministic systems
• Monte-Carlo algorithms for the planar multiterminal network reliability problem
• Monte-Carlo approximation algorithms for enumeration problems
• Non-negative matrices and Markov chains.
• Probabilistic model checking of the CSMA/CD protocol using PRISM and APMC
• Probability Inequalities for Sums of Bounded Random Variables
• Random generation of combinatorial structures from a uniform distribution
• The complexity of probabilistic verification
• The complexity of propositional linear temporal logics
• Tools and Algorithms for the Construction and Analysis of Systems
• Verification, Model Checking, and Abstract Interpretation
• Verification, Model Checking, and Abstract Interpretation

Cited in

(15)

• Approximate verification of the symbolic dynamics of Markov chains
• Distribution, approximation and probabilistic model checking
• Approximate verification and enumeration problems
• Higher-order approximations for verification of stochastic hybrid systems
• Proving approximate implementations for probabilistic I/O automata
• The demand for reliability in probabilistic verification
• Verification, Model Checking, and Abstract Interpretation
• scientific article; zbMATH DE number 2086517 (Why is no real title available?)
• scientific article; zbMATH DE number 1905115 (Why is no real title available?)
• Probabilistic Ianov's schemes
• Probabilistic verification of Boolean functions
• Statistical verification of probabilistic properties with unbounded until
• Approximate Counting in SMT and Value Estimation for Probabilistic Programs
• Perturbation analysis in verification of discrete-time Markov chains
• Quantitative verification of implantable cardiac pacemakers over hybrid heart models

Describes a project that uses

Uses Software

• APMC

This page was built for publication: Probabilistic verification and approximation

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