A uniformization-based algorithm for continuous-time stochastic games model checking
From MaRDI portal
Recommendations
- Continuous-time stochastic games with time-bounded reachability
- Continuous-time stochastic games with time-bounded reachability
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
- Tools and Algorithms for the Construction and Analysis of Systems
- Efficient approximation of optimal control for continuous-time Markov games
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3571890 (Why is no real title available?)
- scientific article; zbMATH DE number 1361121 (Why is no real title available?)
- Automatic verification of competitive stochastic systems
- Continuous-time stochastic games with time-bounded reachability
- Delayed Nondeterminism in Continuous-Time Markov Decision Processes
- Efficient approximation of optimal control for continuous-time Markov games
- Essentials of game theory. A concise, multidisciplinary introduction.
- Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games
- Optimal continuous time Markov decisions
- Optimal time-abstract schedulers for CTMDPs and continuous-time Markov games
- Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan
- Stochastic model checking
This page was built for publication: A uniformization-based algorithm for continuous-time stochastic games model checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1757155)