Abstract:

The importance of model checking was acknowledged by a Turing award in 2007, and formal methods in general have proved extremely useful in the validation of hardware and software systems. These techniques are based on mathematical abstractions, and require models both of the
system, and of the requirements it has to meet. In order to faithfully represent real-life systems, models should incorporate several features including timing contraints, probabilities, unknown
parameters and imperfect information. This habilitation document reports on my contributions to formal methods for complex systems that combine several of these aspects. More specifically, the following problems are tackled: approximate determinization of timed automata, model checking and control for stochastic timed automata, synthesis for partially observable probabilistic systems, and parameterized verification of probabilistic systems.