Pages that link to "Item:Q2575731"
From MaRDI portal
The following pages link to Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes (Q2575731):
Displaying 29 items.
- Efficient approximation of optimal control for continuous-time Markov games (Q259052) (← links)
- Smoothed model checking for uncertain continuous-time Markov chains (Q259074) (← links)
- Three-valued abstraction for probabilistic systems (Q444484) (← links)
- Numerical analysis of continuous time Markov decision processes over finite horizons (Q609814) (← links)
- Engineering constraint solvers for automatic analysis of probabilistic hybrid automata (Q710668) (← links)
- Probabilistic model checking of biological systems with uncertain kinetic rates (Q764350) (← links)
- Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games (Q766176) (← links)
- Efficient computation of the bounds of continuous time imprecise Markov chains (Q902823) (← links)
- Optimal decisions for continuous time Markov decision processes over finite planning horizons (Q1652046) (← links)
- A uniformization-based algorithm for continuous-time stochastic games model checking (Q1757155) (← links)
- Probabilistic reach-avoid problems in nondeterministic systems with time-varying targets and obstacles (Q2139771) (← links)
- Reachability analysis of uncertain systems using bounded-parameter Markov decision processes (Q2389641) (← links)
- Precisely deciding CSL formulas through approximate model checking for CTMCs (Q2402369) (← links)
- Model checking for performability (Q2843861) (← links)
- A Tutorial on Interactive Markov Chains (Q2937729) (← links)
- Computing Behavioral Relations for Probabilistic Concurrent Systems (Q2937734) (← links)
- Time-Bounded Verification of CTMCs against Real-Time Specifications (Q3172840) (← links)
- Time-Bounded Verification (Q3184695) (← links)
- Nested Reachability Approximation for Discrete-Time Markov Chains with Univariate Parameters (Q3457809) (← links)
- Deciding Simulations on Probabilistic Automata (Q3510797) (← links)
- A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains (Q3510814) (← links)
- Delayed Nondeterminism in Continuous-Time Markov Decision Processes (Q3617741) (← links)
- Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates (Q3646252) (← links)
- Compositional Abstraction for Stochastic Systems (Q3648832) (← links)
- (Q4270052) (← links)
- Model Checking Linear-Time Properties of Probabilistic Systems (Q5072555) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5308389) (← links)
- Approximate Time Bounded Reachability for CTMCs and CTMDPs: A Lyapunov Approach (Q6104820) (← links)
- PAC Statistical Model Checking of Mean Payoff in Discrete- and Continuous-Time MDP (Q6487329) (← links)
