30 citations · 32 across the 8 of their papers we have counts for
8 papers
Dynamic network congestion games
Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan +1
Congestion games are a classical type of games studied in game theory, in which n players choose a resource, and their individual cost increases with the number of other players ch…
Incremental methods for checking real-time consistency
Thierry Jéron, Nicolas Markey, David Mentré +2
Requirements engineering is a key phase in the development process. Ensuring that requirements are consistent is essential so that they do not conflict and admit implementations. W…
Conflict-Based Search for Connected Multi-Agent Path Finding
Arthur Queffelec, Ocan Sankur, François Schwarzentruber
We study a variant of the multi-agent path finding problem (MAPF) in which agents are required to remain connected to each other and to a designated base. This problem has applicat…
Abstraction Refinement Algorithms for Timed Automata
Victor Roussanaly, Ocan Sankur, Nicolas Markey
We present abstraction-refinement algorithms for model checking safety properties of timed automata. The abstraction domain we consider abstracts away zones by restricting the set…
Reachability and Coverage Planning for Connected Agents: Extended Version
Tristan Charrier, Arthur Queffelec, Ocan Sankur +1
Motivated by the increasing appeal of robots in information-gathering missions, we study multi-agent path planning problems in which the agents must remain interconnected. We model…
The 4th Reactive Synthesis Competition (SYNTCOMP 2017): Benchmarks, Participants & Results
Swen Jacobs, Nicolas Basset, Roderick Bloem +11
We report on the fourth reactive synthesis competition (SYNTCOMP 2017). We introduce two new benchmark classes that have been added to the SYNTCOMP library, and briefly describe th…