Probabilistic black-box reachability checking (extended version)
From MaRDI portal
Publication:2008284
DOI10.1007/S10703-019-00333-0zbMATH Open1425.68247OpenAlexW2946466316WikidataQ127844330 ScholiaQ127844330MaRDI QIDQ2008284FDOQ2008284
Authors: Bernhard K. Aichernig, Martin Tappler 
Publication date: 25 November 2019
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10703-019-00333-0
Recommendations
- Computer Aided Verification
- Bounded model checking for probabilistic programs
- The probabilistic model checking landscape
- scientific article; zbMATH DE number 1884411
- Computer Aided Verification
- Efficient probabilistic model checking of systems with ranged probabilities
- Bounded Verification of Reachability of Probabilistic Hybrid Systems
- Model checking of reachability problems based on generalized possibility measures
- Model checking of recursive probabilistic systems
Cites Work
- Probabilistic black-box reachability checking (extended version)
- Learning regular sets from queries and counterexamples
- Title not available (Why is that?)
- Quantitative multi-objective verification for probabilistic systems
- Some inequalities relating to the partial sum of binomial probabilities
- Automated technology for verification and analysis. 12th international symposium, ATVA 2014, Sydney, NSW, Australia, November 3--7, 2014. Proceedings
- Automated verification and strategy synthesis for probabilistic systems
- Grammatical inference. Learning automata and grammars.
- Fast randomized consensus using shared memory
- Title not available (Why is that?)
- Title not available (Why is that?)
- A likelihood-ratio test for identifying probabilistic deterministic real-time automata from positive data
- Learning functions represented as multiplicity automata
- On time with minimal expected cost!
- Computer Aided Verification
- Verification of Markov decision processes using learning algorithms
- Learning deterministic probabilistic automata from a model checking perspective
- Learning-based compositional verification for synchronous probabilistic systems
- Learning Moore machines from input-output traces
- Grey-Box Checking
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Computer Aided Verification
Cited In (13)
- \(L^\ast\)-based learning of Markov decision processes (extended version)
- Active model learning of stochastic reactive systems
- Title not available (Why is that?)
- Runtime monitors for Markov decision processes
- Reachability design through approximate Bayesian computation
- Computer Aided Verification
- Grey-Box Checking
- Computer Aided Verification
- prob-black-reach
- A Stochastic Theory of Black-Box Software Testing
- \(L^*\)-based learning of Markov decision processes
- Probabilistic black-box reachability checking (extended version)
- Computational Methods in Systems Biology
Uses Software
This page was built for publication: Probabilistic black-box reachability checking (extended version)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2008284)
