Sciweavers

8 search results - page 2 / 2
» Finite-State Strategies in Regular Infinite Games
Sort
View
TCS
2008
14 years 11 months ago
Decidability and syntactic control of interference
We investigate the decidability of observational equivalence and approximation in Reynolds' "Syntactic Control of Interference" (SCI), a prototypical functionalimpe...
James Laird
CONCUR
2010
Springer
15 years 22 days ago
Obliging Games
Abstract. Graph games of infinite length provide a natural model for open reactive systems: one player (Eve) represents the controller and the other player (Adam) represents the en...
Krishnendu Chatterjee, Florian Horn, Christof L&ou...
76
Voted
SODA
2004
ACM
94views Algorithms» more  SODA 2004»
15 years 1 months ago
Quantitative stochastic parity games
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A...