10 citations · 36 across the 15 of their papers we have counts for
4 papers · 1 filter
An analysis of the equational properties of the well-founded fixed point
Arnaud Carayol, Zoltan Esik
Well-founded fixed points have been used in several areas of knowledge representation and reasoning and to give semantics to logic programs involving negation. They are an importan…
Marking Shortest Paths On Pushdown Graphs Does Not Preserve MSO Decidability
Arnaud Carayol, Olivier Serre
In this paper we consider pushdown graphs, i.e. infinite graphs that can be described as transition graphs of deterministic real-time pushdown automata. We consider the case where…
Pure Strategies in Imperfect Information Stochastic Games
Arnaud Carayol, Christof Löding, Olivier Serre
We consider imperfect information stochastic games where we require the players to use pure (i.e. non randomised) strategies. We consider reachability, safety, Büchi and co-Büchi o…
Counting Branches in Trees Using Games
Arnaud Carayol, Axel Haddad, Olivier Serre
We study finite automata running over infinite binary trees. A run of such an automaton is usually said to be accepting if all its branches are accepting. In this article, we relax…