A uniformization-based algorithm for continuous-time stochastic games model checking
DOI10.1016/j.tcs.2018.10.009zbMath1410.68215OpenAlexW2896167296WikidataQ129101513 ScholiaQ129101513MaRDI QIDQ1757155
Ali Movaghar, Negin Majidi, Shirin Baghoolizadeh
Publication date: 2 January 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.10.009
probabilistic model checkingcontinuous-time Markov gamecontinuous-time stochastic gametime-bounded reachability probability
Applications of game theory (91A80) Stochastic games, stochastic differential games (91A15) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient approximation of optimal control for continuous-time Markov games
- Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games
- Optimal time-abstract schedulers for CTMDPs and continuous-time Markov games
- Continuous-time stochastic games with time-bounded reachability
- Automatic verification of competitive stochastic systems
- Stochastic Model Checking
- Optimal Continuous Time Markov Decisions
- Essentials of Game Theory: A Concise Multidisciplinary Introduction
- Delayed Nondeterminism in Continuous-Time Markov Decision Processes
- Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan
This page was built for publication: A uniformization-based algorithm for continuous-time stochastic games model checking