10 citations · 17 across the 12 of their papers we have counts for
14 papers
Games on Graphs: From Logic and Automata to Algorithms
Nathanaël Fijalkow, C. Aiswarya, Guy Avni +22
The objective of this book is to give a comprehensive presentation of the research field concerned with infinite duration games on graphs. Historically, these game models appeared…
Collapsible Pushdown Parity Games
Christopher H. Broadbent, Arnaud Carayol, Matthew Hague +3
This paper studies a large class of two-player perfect-information turn-based parity games on infinite graphs, namely those generated by collapsible pushdown automata. The main mot…
Higher-Order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties
Christopher H. Broadbent, Arnaud Carayol, C. -H. Luke Ong +1
This paper studies the logical properties of a very general class of infinite ranked trees, namely those generated by higher-order recursion schemes. We consider, for both monadic…
Reasoning about strategies on collapsible pushdown arenas with imperfect information
Bastien Maubert, Aniello Murano, Olivier Serre
Strategy Logic with imperfect information (SLiR) is a very expressive logic designed to express complex properties of strategic abilities in distributed systems. Previous work on S…
How Good Is a Strategy in a Game With Nature?
Arnaud Carayol, Olivier Serre
We consider games with two antagonistic players --- Éloïse (modelling a program) and Abélard (modelling a byzantine environment) --- and a third, unpredictable and uncontrollable p…
Alternating Tree Automata with Qualitative Semantics
Raphaël Berthon, Nathanaël Fijalkow, Emmanuel Filiot +7
We study alternating automata with qualitative semantics over infinite binary trees: alternation means that two opposing players construct a decoration of the input tree called a r…