scientific article; zbMATH DE number 7471666
From MaRDI portal
Publication:5028426
Publication date: 9 February 2022
Full work available at URL: https://arxiv.org/abs/2006.04202
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- What's decidable about hybrid automata?
- A theory of timed automata
- Bounded-parameter Markov decision processes
- Interval-valued finite Markov chains
- Automatic verification of real-time systems with discrete probability distributions.
- Model checking of open interval Markov chains
- Probabilistic timed automata with clock-dependent probabilities
- Qualitative reachability for open interval Markov chains
- On the complexity of model checking interval-valued discrete time Markov chains
- Model checking for probabilistic timed automata
- Reachability analysis of uncertain systems using bounded-parameter Markov decision processes
- Interval iteration algorithm for MDPs and IMDPs
- The complexity of reachability in parametric Markov decision processes
- Polynomial-Time Verification of PCTL Properties of MDPs with Convex Uncertainties
- Quantitative Multi-objective Verification for Probabilistic Systems
- Model Checking One-clock Priced Timed Automata
- Model Checking Probabilistic Timed Automata with One or Two Clocks
- Qualitative Analysis of Partially-Observable Markov Decision Processes
- The Complexity of Markov Decision Processes
- Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities
- CONCUR 2004 - Concurrency Theory
- Robust Control of Markov Decision Processes with Uncertain Transition Matrices
- Model-Checking ω-Regular Properties of Interval Markov Chains
- Tools and Algorithms for the Construction and Analysis of Systems
This page was built for publication:
