Search

• < Previous
• 1
• Next >

---

Antichains for the Automata-Based Approach to Model-Checking

Laurent Doyen ; Jean-Francois Raskin.

We propose and evaluate antichain algorithms to solve the universality and language inclusion problems for nondeterministic Buechi automata, and the emptiness problem for alternating Buechi automata. To obtain those algorithms, we establish the existence of simulation pre-orders that can be&nbsp;[&hellip;]

---

The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games

Thomas Brihaye ; Véronique Bruyère ; Aline Goeminne ; Jean-François Raskin ; Marie van den Bogaard.

We study multiplayer quantitative reachability games played on a finite directed graph, where the objective of each player is to reach his target set of vertices as quickly as possible. Instead of the well-known notion of Nash equilibrium (NE), we focus on the notion of subgame perfect equilibrium&nbsp;[&hellip;]

---

Subgame-perfect Equilibria in Mean-payoff Games (journal version)

Léonard Brice ; Marie van den Bogaard ; Jean-François Raskin.

In this paper, we provide an effective characterization of all the subgame-perfect equilibria in infinite duration games played on finite graphs with mean-payoff objectives. To this end, we introduce the notion of requirement, and the notion of negotiation function. We establish that the plays that&nbsp;[&hellip;]

---