48 citations · 241 across the 30 of their papers we have counts for
34 papers
Non-Blind Strategies in Timed Network Congestion Games
Aline Goeminne, Nicolas Markey, Ocan Sankur
Network congestion games are a convenient model for reasoning about routing problems in a network: agents have to move from a source to a target vertex while avoiding congestion, m…
Parameterized safety verification of round-based shared-memory systems
Nathalie Bertrand, Nicolas Markey, Ocan Sankur +1
We consider the parameterized verification problem for distributed algorithms where the goal is to develop techniques to prove the correctness of a given algorithm regardless of th…
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…
Computing maximally-permissive strategies in acyclic timed automata
Emily Clement, Thierry Jéron, Nicolas Markey +1
Timed automata are a convenient mathematical model for modelling and reasoning about real-time systems. While they provide a powerful way of representing timing aspects of such sys…
Active learning of timed automata with unobservable resets
Léo Henry, Nicolas Markey, Thierry Jéron
Active learning of timed languages is concerned with the inference of timed automata from observed timed words. The agent can query for the membership of words in the target langua…
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…