2 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.LO2020
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…
cs.FL2017★ 2 cited
Two-way Two-tape Automata
Olivier Carton, Léo Exibard, Olivier Serre
In this article we consider two-way two-tape (alternating) automata accepting pairs of words and we study some closure properties of this model. Our main result is that such altern…
cs.FL2015★ 1 cited
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…