From the 1 of 6 linked papers with an AI index.
6 papers
A Zielonka-type Construction for Connectedly Communicating Processes
Béatrice Bérard, Benjamin Monmege, B Srivathsan +1
The paper extends Zielonka’s construction to synthesize deterministic asynchronous automata from DFA specifications when processes communicate with a bounded delay, allowing some p…
Synthesising Asynchronous Automata from Fair Specifications
Béatrice Bérard, Benjamin Monmege, B Srivathsan +1
Asynchronous automata are a model of distributed finite state processes synchronising on shared actions. A celebrated result by Zielonka shows how a deterministic asynchronous auto…
Games on Graphs: From Logic and Automata to Algorithms
Nathanaël Fijalkow, C. Aiswarya, Guy Avni +22
The objective of this book is to give a comprehensive presentation of the research field concerned with infinite duration games on graphs. Historically, these game models appeared…
Playing Stochastically in Weighted Timed Games to Emulate Memory
Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
Weighted timed games are two-player zero-sum games played in a timed automaton equipped with integer weights. We consider optimal reachability objectives, in which one of the playe…
Decidability of One-Clock Weighted Timed Games with Arbitrary Weights
Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
Weighted Timed Games (WTG for short) are the most widely used model to describe controller synthesis problems involving real-time issues. Unfortunately, they are notoriously diffic…
Permissive Equilibria in Multiplayer Reachability Games
Aline Goeminne, Benjamin Monmege
We study multi-strategies in multiplayer reachability games played on finite graphs. A multi-strategy prescribes a set of possible actions, instead of a single action as usual stra…