Sciweavers

48 search results - page 6 / 10
» The Winning Ways of Concurrent Games
Sort
View
FOSSACS
2009
Springer
14 years 2 months ago
Facets of Synthesis: Revisiting Church's Problem
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
Wolfgang Thomas
FORMATS
2008
Springer
13 years 9 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...
ROBOCUP
1999
Springer
120views Robotics» more  ROBOCUP 1999»
13 years 11 months ago
The CMUnited-99 Champion Simulator Team
TheCMUnited-99 simulator team became the 1999 RoboCup simulator league champion by winning all 8 of its games, outscoring opponents by a combined score of 110{0. CMUnited-99 builds...
Peter Stone, Patrick Riley, Manuela M. Veloso
COMPSAC
2005
IEEE
14 years 29 days ago
Designing Controllers for Reachability
We propose a deductive method for constructing reliable reachability controllers, with application to fault-tolerant discrete systems. Designing the controller reduces to finding...
Cristina Cerschi Seceleanu
CONCUR
2007
Springer
14 years 1 months ago
Asynchronous Games: Innocence Without Alternation
The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of λ-terms and PCF programs. An innocent strategy is defined as an ...
Paul-André Melliès, Samuel Mimram