31 search results - page 5 / 7 » Minimum-Time Reachability in Timed Games |
SAGT
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. In game theory, a player’s action is said to be weakly dominated if there exists another action that, with respect to what the other players do, is never worse and some...
CONCUR
2009
Springer
14 years 5 months ago
2009
Springer
In this paper, we extend the classical notion of strategies in turn-based finite games by allowing several moves to be selected. We define and study a quantitative measure for pe...
ICRA
2005
IEEE
14 years 4 months ago
2005
IEEE
— In this work we consider the problem of pursuit evasion games (PEGs) where a group of pursuers is required to detect, chase and capture a group of evaders with the aid of a sen...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
The success of probabilistic model checking for discrete-time Markov decision processes and continuous-time Markov chains has led to rich academic and industrial applications. The ...
ISSTA
2004
ACM
14 years 4 months ago
2004
ACM
This paper deals with testing of nondeterministic software systems. We assume that a model of the nondeterministic system is given by a directed graph with two kind of vertices: s...