output
20062021
most citedModel-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable

77 citations

researchers with a paper here
collaborating institutions
Showing cs.GTShow all

3 papers · 1 filter

cs.GT2020★ 18 cited

Games Where You Can Play Optimally with Arena-Independent Finite Memory

Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj +2

For decades, two-player (antagonistic) games on graphs have been a framework of choice for many important problems in theoretical computer science. A notorious one is controller sy…

cs.GT2015★ 11 cited

Entropy Games and Matrix Multiplication Games

Eugene Asarin, Julien Cervelle, Aldric Degorre +3

Two intimately related new classes of games are introduced and studied: entropy games (EGs) and matrix multiplication games (MMGs). An EG is played on a finite arena by two-and-a-h…

cs.GT2013★ 4 cited

Model Checking an Epistemic mu-calculus with Synchronous and Perfect Recall Semantics

Rodica Bozianu, Catalin Dima, Constantin Enea

We identify a subproblem of the model-checking problem for the epistemic μ-calculus which is decidable. Formulas in the instances of this subproblem allow free variables within the…