Solving Games Without Determinization

13 years 8 months ago

Download mtc.epfl.ch

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 or nondeterministic B

Thomas A. Henzinger, Nir Piterman

Real-time Traffic

Automated Reasoning | CSL 2006 | Equivalent Deterministic Automaton | Nondeterministic B¨uchi | Nondeterministic Parity Automaton |

claim paper

» Alpaga A Tool for Solving Parity Games with Imperfect Information

» A GameTheoretic Approach to Determining Efficient Patrolling Strategies for Mobile Robots

» Concurrent OmegaRegular Games

» Solving Stackelberg games with uncertain observability

» Solving Kriegspiel Endings with Brute Force The Case of KR vs K

» Finding Equilibria in Games of No Chance

» The relation between protocols and games

» Complexity of iterated dominance

Post Info
More Details (n/a)

Added	22 Aug 2010
Updated	22 Aug 2010
Type	Conference
Year	2006
Where	CSL
Authors	Thomas A. Henzinger, Nir Piterman

Comments (0)

Sciweavers

Solving Games Without Determinization

Automated Reasoning | CSL 2006 | Equivalent Deterministic Automaton | Nondeterministic B¨uchi | Nondeterministic Parity Automaton |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers