3 papers
cs.FL2020
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…
cs.LO2020
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…
cs.FL2020
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…