Exact quantitative probabilistic model checking through rational search
DOI10.1007/s10703-020-00348-yzbMath1506.68057OpenAlexW3046724773MaRDI QIDQ2225475
Publication date: 8 February 2021
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10703-020-00348-y
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Markov and semi-Markov decision processes (90C40) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal search for rationals
- The dining cryptographers problem: Unconditional sender and recipient untraceability
- Sylvan
- Probabilistic model checking of deadline properties in the IEEE 1394 fireWire root contention protocol
- Model checking of probabilistic and nondeterministic systems
- Quantitative Multi-objective Verification for Probabilistic Systems
- Reachability in MDPs: Refining Convergence of Value Iteration
- Verification of Markov Decision Processes Using Learning Algorithms
- Value Iteration
- Graph-Based Algorithms for Boolean Function Manipulation
- Reliability Analysis of Large Circuits Using Scalable Techniques and Tools
- Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems
- Theoretical Aspects of Computing - ICTAC 2004
This page was built for publication: Exact quantitative probabilistic model checking through rational search
