97 search results - page 11 / 20 » Visibly Pushdown Games |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Operator precedence grammars define a classical Boolean and deterministic context-free family (called Floyd languages or FLs). FLs have been shown to strictly include the...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
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...
ESOP
2008
Springer
14 years 4 days ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
GI
2009
Springer
13 years 8 months ago
2009
Springer
: Both, games in a game theoretic sense and protocols in an informational sense describe rule based interactions between systems. Some similarities and differences of both approach...
ICALP
2004
Springer
14 years 3 months ago
2004
Springer
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete ...