75 search results - page 12 / 15 » Mean-Payoff Parity Games |
121
click to vote
CSL
2006
Springer
15 years 9 months ago
2006
Springer
The synthesis of reactive systems requires the solution of two-player games on graphs with -regular objectives. When the objective is specified by a linear temporal logic formula o...
184
click to vote
CALCO
2009
Springer
16 years 19 days ago
2009
Springer
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...
174
click to vote
ISAAC
2009
Springer
16 years 18 days ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
162
click to vote
FOSSACS
2009
Springer
16 years 25 days ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
146
click to vote
FSTTCS
2005
Springer
15 years 11 months ago
2005
Springer
Much recent research has focused on the applications of games with ω-regular objectives in the control and verification of reactive systems. However, many of the game-based model...