Pages that link to "Item:Q2864840"
From MaRDI portal
The following pages link to Polynomial-Time Verification of PCTL Properties of MDPs with Convex Uncertainties (Q2864840):
Displaying 19 items.
- Exploiting robust optimization for interval probabilistic bisimulation (Q1693117) (← links)
- Reachability in parametric interval Markov chains using constraints (Q1786613) (← links)
- The complexity of reachability in parametric Markov decision processes (Q2662678) (← links)
- Deniable Functional Encryption (Q2798776) (← links)
- Multi-objective Parameter Synthesis in Probabilistic Hybrid Systems (Q2945585) (← links)
- Sequential Convex Programming for the Efficient Verification of Parametric MDPs (Q3303926) (← links)
- (Q5028426) (← links)
- Scenario-Based Verification of Uncertain MDPs (Q5039513) (← links)
- Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities (Q5041280) (← links)
- On the Complexity of Reachability in Parametric Markov Decision Processes (Q5875375) (← links)
- Robust Control for Dynamical Systems with Non-Gaussian Noise via Formal Abstractions (Q5881801) (← links)
- Sampling-Based Verification of CTMCs with Uncertain Rates (Q6399373) (← links)
- Verification of Indefinite-Horizon POMDPs (Q6485882) (← links)
- Abstraction-Refinement for Hierarchical Probabilistic Models (Q6487314) (← links)
- Efficient sensitivity analysis for parametric robust Markov chains (Q6535680) (← links)
- Formal controller synthesis for Markov jump linear systems with uncertain dynamics (Q6546444) (← links)
- Parameter synthesis for Markov models: covering the parameter space (Q6564178) (← links)
- Interval Markov decision processes with multiple objectives: from robust strategies to Pareto curves (Q6600072) (← links)
- Robust probabilistic temporal logics (Q6663513) (← links)
