Sciweavers

211 search results - page 1 / 43
» Solving Games Without Determinization
Sort
View
CSL
2006
Springer
13 years 9 months ago
Solving Games Without Determinization
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...
Thomas A. Henzinger, Nir Piterman
NETGAMES
2005
ACM
13 years 10 months ago
A challenge for reusing multiplayer online games without modifying binaries
In this paper, we advocate the problem of reusing Multiplayer Online Game (MOG) in Client-Server (C/S) architecture. The problem is that MOG services cannot continue to be provide...
Yugo Kaneda, Hitomi Takahashi, Masato Saito, Hirot...
TACAS
2009
Springer
157views Algorithms» more  TACAS 2009»
14 years 1 days ago
Alpaga: A Tool for Solving Parity Games with Imperfect Information
Alpaga is a solver for parity games with imperfect information. Given the description of a game, it determines whether the first player can ensure to win and, if so, it constructs...
Dietmar Berwanger, Krishnendu Chatterjee, Martin D...
IAT
2008
IEEE
13 years 5 months ago
A Game-Theoretic Approach to Determining Efficient Patrolling Strategies for Mobile Robots
Use of game-theoretic models to address patrolling applications has gained increasing interest in the very last years. The patrolling agent is considered playing a game against an...
Francesco Amigoni, Nicola Gatti, Antonio Ippedico
LICS
2000
IEEE
13 years 9 months ago
Concurrent Omega-Regular Games
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...
Luca de Alfaro, Thomas A. Henzinger