10 citations · 36 across the 15 of their papers we have counts for
3 papers · 1 filter
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…
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…