Sciweavers

FORMATS
2010
Springer
13 years 2 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-...
JCT
2010
92views more  JCT 2010»
13 years 3 months ago
Enumeration by kernel positions for strongly Bernoulli type truncation games on words
We find the winning strategy for a class of truncation games played on words. As a consequence of the present author’s recent results on some of these games we obtain new formul...
Gábor Hetyei
RSA
2008
125views more  RSA 2008»
13 years 4 months ago
The game chromatic number of random graphs
: Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player ...
Tom Bohman, Alan M. Frieze, Benny Sudakov
ENTCS
2006
138views more  ENTCS 2006»
13 years 4 months ago
Propositional Games with Explicit Strategies
This paper presents a game semantics for LP, Artemov's Logic of Proofs. The language of LP extends that of propositional logic by adding formula-labeling terms, permitting us...
Bryan Renne
CORR
2006
Springer
103views Education» more  CORR 2006»
13 years 4 months ago
Positional Determinacy of Games with Infinitely Many Priorities
We study two-player games of infinite duration that are played on finite or infinite game graphs. A winning strategy for such a game is positional if it only depends on the current...
Erich Grädel, Igor Walukiewicz