Faster statistical model checking for unbounded temporal properties
From MaRDI portal
Publication:2272915
DOI10.1007/978-3-662-49674-9_7zbMath1420.68123arXiv1504.05739OpenAlexW2735692890MaRDI QIDQ2272915
Thomas A. Henzinger, Tatjana Petrov, Przemysław Daca, Jan Křetínský
Publication date: 17 September 2019
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.05739
Related Items (7)
Statistical Model Checking for Variability-Intensive Systems ⋮ Probabilistic causes in Markov chains ⋮ Value iteration for simple stochastic games: stopping criterion and learning algorithm ⋮ Satisfiability of quantitative probabilistic CTL: rise to the challenge ⋮ A framework for transforming specifications in reinforcement learning ⋮ Unnamed Item ⋮ Statistical model checking for variability-intensive systems: applications to bug detection and minimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Continuity of the value of competitive Markov decision processes
- Probabilistic verification and approximation
- Statistical probabilistic model checking with a focus on time-bounded properties
- Robustness of Structurally Equivalent Concurrent Parity Games
- A Platform for High Performance Statistical Model Checking – PLASMA
- Statistical Verification of Probabilistic Properties with Unbounded Until
- Verification of Markov Decision Processes Using Learning Algorithms
- Statistical Model Checking Using Perfect Simulation
- Markov Chains
- Computer Aided Verification
- Tools and Algorithms for the Construction and Analysis of Systems
- Computer Aided Verification
- Sequential Tests of Statistical Hypotheses
This page was built for publication: Faster statistical model checking for unbounded temporal properties
