231 search results - page 2 / 47 » Concurrent Reachability Games |
56
Voted
CORR
2008
Springer
15 years 27 days ago
2008
Springer
111
Voted
CORR
2010
Springer
15 years 27 days ago
2010
Springer
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
87
Voted
ICALP
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We consider the minimum-time reachability problem in concurrent two-player timed automaton game structures. We show how to compute the minimum time needed by a player to ...
103
Voted
FOSSACS
2012
Springer
13 years 8 months ago
2012
Springer
We consider concurrent games played on graphs, in which each player has several qualitative (e.g. reachability or B¨uchi) objectives, and a preorder on these objectives (for insta...
115
Voted
STOC
2001
ACM
16 years 1 months ago
2001
ACM
We consider two-player games played for an infinite number of rounds, with -regular winning conditions. The games may be concurrent, in that the players choose their moves simulta...