Pages that link to "Item:Q3511248"

The following pages link to A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes (Q3511248):

Displayed 9 items.

• Efficient approximation of optimal control for continuous-time Markov games (Q259052) ‎ (← links)
• Three-valued abstraction for probabilistic systems (Q444484) ‎ (← links)
• Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games (Q766176) ‎ (← links)
• The metric linear-time branching-time spectrum on nondeterministic probabilistic processes (Q1989321) ‎ (← links)
• Cost vs. time in stochastic games and Markov automata (Q2403526) ‎ (← links)
• Computing Behavioral Relations for Probabilistic Concurrent Systems (Q2937734) ‎ (← links)
• (Q3384913) ‎ (← links)
• Deciding Simulations on Probabilistic Automata (Q3510797) ‎ (← links)
• Delayed Nondeterminism in Continuous-Time Markov Decision Processes (Q3617741) ‎ (← links)