Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 2 of 2 for “"Unendliches Spiel"”.
-
Strategiesynthese für Paritätsspiele auf endlichen Graphen
Parity games are infinite two person games, here considered on finite graphs. A play is an infinite path in the graph, whose vertices are chosen by the two players in alternation. The winner of the play is determined by the vertices that are visited infinitely often in the play. The problem of …
-
Games on pushdown graphs and extensions
Two player games are a standard model of reactive computation, where e.g. one player is the controller and the other is the environment. A game is won by a player if she has a winning strategy, ie, if she can win every play. Given a finite description of the game, our aim is to compute the winner …