Efficient Computation of Time-Bounded Reachability Probabilities in Uniform Continuous-Time Markov Decision Processes
Abstract elided by the publisher.
Related papers
- CTMCs with Imprecisely Timed Observations TACAS 2024
- Fast Computation of Conditional Probabilities in MDPs and Markov Chain Families CAV 2026
- PAC Statistical Model Checking of Mean Payoff in Discrete- and Continuous-Time MDP CAV 2022
- PAC Statistical Model Checking for Markov Decision Processes and Stochastic Games CAV 2019
- Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains CAV 2025
- Monitoring CTMCs by Multi-clock Timed Automata CAV 2018
- Optimal Time-Bounded Reachability Analysis for Concurrent Systems TACAS 2019
- Global PAC Bounds for Learning Discrete Time Markov Chains CAV 2020