10 citations · 32 across the 19 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2024
A positional -complete objective
Antonio Casares, Pierre Ohlmann, Pierre Vandenhove
We study zero-sum, turn-based games on graphs. In this note, we show the existence of a game objective that is -complete for the Borel hierarchy and that is positiona…
cs.CC2017
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem
Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine +2
The \emph{Orbit Problem} consists of determining, given a linear transformation on , together with vectors and , whether the orbit of under repeated ap…