88 search results - page 4 / 18 » Reachability in Stochastic Timed Games |
FSTTCS
2004
Springer
14 years 25 days ago
2004
Springer
Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability priced timed game automata and prove ...
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
We consider the standard model of finite two-person zero-sum stochastic games with signals. We are interested in the existence of almost-surely winning or positively winning stra...
CIE
2008
Springer
13 years 9 months ago
2008
Springer
We revisit the deterministic graphical games of Washburn. A deterministic graphical game can be described as a simple stochastic game (a notion due to Anne Condon), except that we ...
FMSD
2007
13 years 7 months ago
2007
We study the cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations. By optimality, we mean an infi...
ICTAI
2005
IEEE
14 years 1 months ago
2005
IEEE
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reach...