2 citations · 5 across the 8 of their papers we have counts for
3 papers · 1 filter
Optimal strategies in concurrent reachability games
Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux
We study two-player reachability games on finite graphs. At each state the interaction between the players is concurrent and there is a stochastic Nature. Players also play stochas…
From local to global determinacy in concurrent graph games
Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux
In general, finite concurrent two-player reachability games are only determined in a weak sense: the supremum probability to win can be approached via stochastic strategies, but ca…
Anti-unification of Unordered Goals
Gonzague Yernaux, Wim Vanhoof
Anti-unification in logic programming refers to the process of capturing common syntactic structure among given goals, computing a single new goal that is more general called a gen…