Approximate verification and enumeration problems

DOI10.1007/978-3-642-32943-2_18MaRDI QIDQ2915109zbMATH OpenOpenAlexFDO

Authors Sylvain Peyronnet, Michel de Rougemont, Yann Strozecki

Publication date 21 September 2012

Published in Theoretical Aspects of Computing – ICTAC 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32943-2_18

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Probabilistic verification and approximation
• Monte-Carlo approximation algorithms for enumeration problems
• Randomised enumeration of small witnesses using a decision oracle
• A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
• Stochastic enumeration method for counting NP-hard problems

Cited in

(4)

• Randomised enumeration of small witnesses using a decision oracle
• Counter machines and verification problems.
• Verified Approximation Algorithms
• Comparing labelled Markov decision processes

This page was built for publication: Approximate verification and enumeration problems

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