1 citations · 2 across the 7 of their papers we have counts for
5 papers · 1 filter
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…
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…
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…
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…
Control strategies for off-line testing of timed systems
Léo Henry, Thierry Jéron, Nicolas Markey
Partial observability and controllability are two well-known issues in test-case synthesis for interactive systems. We address the problem of partial control in the synthesis of te…