Sciweavers

125 search results - page 2 / 25
» A New Algorithm for Strategy Synthesis in LTL Games
Sort
View
ATVA
2007
Springer
111views Hardware» more  ATVA 2007»
13 years 11 months ago
Timed Control with Observation Based and Stuttering Invariant Strategies
In this paper we consider the problem of controller synthesis for timed games under imperfect information. Novel to our approach is the requirements to strategies: they should be b...
Franck Cassez, Alexandre David, Kim Guldstrand Lar...
FORMATS
2010
Springer
13 years 3 months ago
Combining Symbolic Representations for Solving Timed Games
We present a general approach to combine symbolic state space representations for the discrete and continuous parts in the synthesis of winning strategies for timed reachability ga...
Rüdiger Ehlers, Robert Mattmüller, Hans-...
ATAL
2008
Springer
13 years 7 months ago
Synthesis of strategies from interaction traces
We describe how to take a set of interaction traces produced by different pairs of players in a two-player repeated game, and combine them into a composite strategy. We provide an...
Tsz-Chiu Au, Sarit Kraus, Dana S. Nau
UAI
2004
13 years 6 months ago
Computing Best-Response Strategies in Infinite Games of Incomplete Information
We describe an algorithm for computing bestresponse strategies in a class of two-player infinite games of incomplete information, defined by payoffs piecewise linear in agents...
Daniel M. Reeves, Michael P. Wellman
FORMATS
2008
Springer
13 years 6 months ago
Timed Parity Games: Complexity and Robustness
We consider two-player games played in real time on game structures with clocks and parity objectives. The games are concurrent in that at each turn, both players independently pro...
Krishnendu Chatterjee, Thomas A. Henzinger, Vinaya...