Continuous-time stochastic games with time-bounded reachability

被引：15

作者：

Brazdil, Tomas ^{[1
]}

Forejt, Vojtech ^{[1
]}

Krcal, Jan ^{[1
]}

Kretinsky, Jan ^{[1
]}

Kucera, Antonin ^{[1
]}

机构：

[1] Masaryk Univ, Fac Informat, Brno 60200, Czech Republic

来源：

INFORMATION AND COMPUTATION | 2013年 / 224卷

关键词：

Continuous time stochastic systems; Time-bounded reachability; Stochastic games;

D O I：

10.1016/j.ic.2013.01.001

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We study continuous-time stochastic games with time-bounded reachability objectives and time-abstract strategies. We show that each vertex in such a game has a value (i.e., an equilibrium probability), and we classify the conditions under which optimal strategies exist. Further, we show how to compute epsilon-optimal strategies in finite games and provide detailed complexity estimations. Moreover, we show how to compute epsilon-optimal strategies in infinite games with finite branching and bounded rates where the bound as well as the successors of a given state are effectively computable. Finally, we show how to compute optimal strategies in finite uniform games. (C) 2013 Elsevier Inc. All rights reserved.

引用

页码：46 / 70

页数：25

共 50 条

[1] Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games
Markus N. Rabe
Sven Schewe
[J]. Acta Informatica, 2011, 48
[2] Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games
Rabe, Markus N.
Schewe, Sven
[J]. ACTA INFORMATICA, 2011, 48 (5-6) : 291 - 315
[3] Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
Baier, C
Hermanns, H
Katoen, JP
Haverkort, BR
[J]. THEORETICAL COMPUTER SCIENCE, 2005, 345 (01) : 2 - 26
[4] Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
Baier, C
Haverkort, B
Hermanns, H
Katoen, JP
[J]. TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PROCEEDINGS, 2004, 2988 : 61 - 76
[5] Policy Learning for Time-Bounded Reachability in Continuous-Time Markov Decision Processes via Doubly-Stochastic Gradient Ascent
Bartocci, Ezio
Bortolussi, Luca
Brazdil, Tomas
Milios, Dimitrios
Sanguinetti, Guido
[J]. QUANTITATIVE EVALUATION OF SYSTEMS, QEST 2016, 2016, 9826 : 244 - 259
[6] Continuous-time stochastic games
Neyman, Abraham
[J]. GAMES AND ECONOMIC BEHAVIOR, 2017, 104 : 92 - 130
[7] Approximate Parameter Synthesis for Probabilistic Time-Bounded Reachability
Han, Tingting
Katoen, Joost-Pieter
Mereacre, Alexandru
[J]. RTSS: 2008 REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS, 2008, : 173 - 182
[8] Time-Bounded Model Checking of Infinite-State Continuous-Time Markov Chains
Hahn, E. Moritz
Hermanns, Holger
Wachter, Bjoern
Zhang, Lijun
[J]. FUNDAMENTA INFORMATICAE, 2009, 95 (01) : 129 - 155
[9] Time-Bounded Model Checking of Infinite-State Continuous-Time Markov Chains
Zhang, Lijun
Hermanns, Holger
Hahn, E. Moritz
Wachter, Bjoern
[J]. 2008 8TH INTERNATIONAL CONFERENCE ON APPLICATION OF CONCURRENCY TO SYSTEM DESIGN, PROCEEDINGS, 2008, : 98 - 107
[10] Optimal Time-Bounded Reachability Analysis for Concurrent Systems
Butkova, Yuliya
Fox, Gereon
[J]. TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PT II, 2019, 11428 : 191 - 208

← 1 2 3 4 5 →