Sciweavers

88 search results - page 3 / 18
» Reachability in Stochastic Timed Games
Sort
View
FORMATS
2010
Springer
13 years 3 months ago
Expected Reachability-Time Games
In an expected reachability-time game (ERTG) two players, Min and Max, move a token along the transitions of a probabilistic timed automaton, so as to minimise and maximise, respec...
Vojtech Forejt, Marta Z. Kwiatkowska, Gethin Norma...
SIAMCO
2008
113views more  SIAMCO 2008»
13 years 5 months ago
Singularly Perturbed Piecewise Deterministic Games
Abstract. In this paper we consider a class of hybrid stochastic games with the piecewise openloop information structure. These games are indexed over a parameter which represents...
Alain Haurie, Francesco Moresino
FORMATS
2006
Springer
13 years 9 months ago
Extended Directed Search for Probabilistic Timed Reachability
Current numerical model checkers for stochastic systems can efficiently analyse stochastic models. However, the fact that they are unable to provide debugging information constrain...
Husain Aljazzar, Stefan Leue
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
14 years 8 days ago
The Complexity of Solving Stochastic Games on Graphs
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
Daniel Andersson, Peter Bro Miltersen