1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.GT2012
On Equilibria in Quantitative Games with Reachability/Safety Objectives
Thomas Brihaye, Véronique Bruyère, Julie De Pril
In this paper, we study turn-based quantitative multiplayer non zero-sum games played on finite graphs with both reachability and safety objectives. In this framework a player with…
cs.FL2012★ 1 cited
Visibly pushdown automata on trees: universality and u-universality
Véronique Bruyère, Marc Ducobu, Olivier Gauwin
An automaton is universal if it accepts every possible input. We study the notion of u-universality, which asserts that the automaton accepts every input starting with u. Universal…