2 citations · 5 across the 8 of their papers we have counts for
14 papers
Multi-Environment MDPs with Prior and Universal Semantics
Benjamin Bordais, Jean-François Raskin
Multiple-environment Markov decision processes (MEMDPs) equip an MDP with several probabilistic transition functions (one per possible environment) so that the state is observable…
Learning DFAs from Positive Examples Only via Word Counting
Benjamin Bordais, Daniel Neider
Learning finite automata from positive examples has recently gained attention as a powerful approach for understanding, explaining, analyzing, and verifying black-box systems. The…
A framework for computing upper bounds in passive learning settings
Benjamin Bordais, Daniel Neider
The task of inferring logical formulas from examples has garnered significant attention as a means to assist engineers in creating formal specifications used in the design, synthes…
The Complexity of Learning Temporal Properties
Benjamin Bordais, Daniel Neider, Rajarshi Roy
We consider the problem of learning temporal logic formulas from examples of system behavior. Learning temporal properties has crystallized as an effective mean to explain complex…
Learning Branching-Time Properties in CTL and ATL via Constraint Solving
Benjamin Bordais, Daniel Neider, Rajarshi Roy
We address the problem of learning temporal properties from the branching-time behavior of systems. Existing research in this field has mostly focused on learning linear temporal p…
Learning Temporal Properties is NP-hard
Benjamin Bordais, Daniel Neider, Rajarshi Roy
We investigate the complexity of LTL learning, which consists in deciding given a finite set of positive ultimately periodic words, a finite set of negative ultimately periodic wor…
From Local To Global Optimality in Concurrent Parity Games
Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux
We study two-player games on finite graphs. Turn-based games have many nice properties, but concurrent games are harder to tame: e.g. turn-based stochastic parity games have positi…
Sub-game optimal strategies in concurrent games with prefix-independent objectives
Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux
We investigate concurrent two-player win/lose stochastic games on finite graphs with prefix-independent objectives. We characterize subgame optimal strategies and use this characte…
Strategy Synthesis for Global Window PCTL
Benjamin Bordais, Damien Busatto-Gaston, Shibashis Guha +1
Given a Markov decision process (MDP) and a formula , the strategy synthesis problem asks if there exists a strategy s.t. the resulting Markov chain satisfies …
Playing (Almost-)Optimally in Concurrent Büchi and co-Büchi Games
Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux
We study two-player concurrent stochastic games on finite graphs, with Büchi and co-Büchi objectives. The goal of the first player is to maximize the probability of satisfying the…
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…
Expected Window Mean-Payoff
Benjamin Bordais, Shibashis Guha, Jean-François Raskin
In the window mean-payoff objective, given an infinite path, instead of considering a long run average, we consider the minimum payoff that can be ensured at every position of the…