Search

• < Previous
• 1
• Next >

---

Model Checking One-clock Priced Timed Automata

Patricia Bouyer ; Kim G. Larsen ; Nicolas Markey.

We consider the model of priced (a.k.a. weighted) timed automata, an extension of timed automata with cost information on both locations and transitions, and we study various model-checking problems for that model based on extensions of classical temporal logics with cost constraints on modalities.&nbsp;[&hellip;]

---

O-Minimal Hybrid Reachability Games

Patricia Bouyer ; Thomas Brihaye ; Fabrice Chevalier.

In this paper, we consider reachability games over general hybrid systems, and distinguish between two possible observation frameworks for those games: either the precise dynamics of the system is seen by the players (this is the perfect observation framework), or only the starting point and the&nbsp;[&hellip;]

---

Pure Nash Equilibria in Concurrent Deterministic Games

Patricia Bouyer ; Romain Brenguier ; Nicolas Markey ; Michael Ummels.

We study pure-strategy Nash equilibria in multi-player concurrent deterministic games, for a variety of preference relations. We provide a novel construction, called the suspect game, which transforms a multi-player concurrent game into a two-player turn-based game which turns Nash equilibria into&nbsp;[&hellip;]

---

Half-Positional Objectives Recognized by Deterministic B\"uchi Automata

Patricia Bouyer ; Antonio Casares ; Mickael Randour ; Pierre Vandenhove.

In two-player games on graphs, the simplest possible strategies are those that can be implemented without any memory. These are called positional strategies. In this paper, we characterize objectives recognizable by deterministic B\"uchi automata (a subclass of omega-regular objectives) that are&nbsp;[&hellip;]

---