activity
20012026
most citedAlgorithms for Omega-Regular Games with Imperfect Information

171 citations · 821 across the 108 of their papers we have counts for

collaborators
Showing 2010Show all

11 papers · 1 filter

cs.CE2010★ 2 cited

Lumpability Abstractions of Rule-based Systems

Jerome Feret, Thomas Henzinger, Heinz Koeppl +1

The induction of a signaling pathway is characterized by transient complex formation and mutual posttranslational modification of proteins. To faithfully capture this combinatorial…

cs.LO2010★ 15 cited

Timed Parity Games: Complexity and Robustness

Krishnendu Chatterjee, Thomas A. Henzinger, Vinayak S. Prabhu

We consider two-player games played in real time on game structures with clocks where the objectives of players are described using parity conditions. The games are \emph{concurren…

cs.LO2010★ 45 cited

Expressiveness and Closure Properties for Quantitative Languages

Krishnendu Chatterjee, Laurent Doyen, Thomas A Henzinger

Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages~ that assign to each word~ a real number~.…

cs.LO2010

Generalized Mean-payoff and Energy Games

Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger +1

In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective…

cs.LO2010★ 35 cited

Mean-payoff Automaton Expressions

Krishnendu Chatterjee, Laurent Doyen, Herbert Edelsbrunner +2

Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on transitions…

cs.GT2010★ 49 cited

Randomness for Free

Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert +1

We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the ba…