Contributions à l'approche automate pour la vérification de propriétés de systèmes concurrents

The automata theoretic approach to model checking linear-time temporal properties is a classical verification technique for concurrent systems. Both the system and the property to verify are expressed as automata on infinite words (ω-automata). Some operations on these automata establish whether the property holds in the system. In this thesis we focus on a kind of ω-automata called Transition-based Generalized Büchi Automata (TGBA). We start by revisiting the main two steps of the approach: the translation of linear-time temporal logic formulæ into TGBA, and the emptiness check of TGBA. For each of these steps, we offer improvements to existing algorithms, and compare them to show the benefits of using TGBA. We then introduce two variants of the emptiness check algorithm. The first one can be combined with algorithms that aim at reducing the automaton which represents the system by gathering some of its states symbolically. The new emptiness check uses inclusion checks between these symbolic sets of states to drive the on-the-fly construction of the automaton. The second variant is a generalization to (transition-based) Streett automata; it enables the verification of properties under strong fairness assumptions.