Skip to Main content Skip to Navigation
Theses

Vérification formelle de systèmes. Contribution à la réduction de l'explosion combinatoire

Abstract : Formal verification technique often runs up against the combinatorial explosion problem: the number of states of the transitions system grows in an exponential way with respect to the component count of the system. This thesis study two causes: - For untimed systems, concurrency is represented by actions interleaving which produces a lot of combinations. This thesis investigates partial-order approaches to compute a reduced graph. Techniques based on transitions step are proposed for different properties classes. - For timed systems, time constraints can produce explosion of the exploration. This thesis proposes to compute an over-approximation of the system, in order to build a smaller behavior graph. The property is checked on the over-approximation. If the analysis of the over-approximation doesn't allow to conclude, the system behavior is checked, guided by results founded on the over-approximation.
Complete list of metadata

https://tel.archives-ouvertes.fr/tel-00011360
Contributor : Catherine Martineau <>
Submitted on : Thursday, January 12, 2006 - 10:13:40 AM
Last modification on : Friday, January 10, 2020 - 9:08:09 PM
Long-term archiving on: : Saturday, April 3, 2010 - 9:13:39 PM

Identifiers

  • HAL Id : tel-00011360, version 1

Citation

Pierre-Olivier Ribet. Vérification formelle de systèmes. Contribution à la réduction de l'explosion combinatoire. Réseaux et télécommunications [cs.NI]. INSA de Toulouse, 2005. Français. ⟨tel-00011360⟩

Share

Metrics

Record views

332

Files downloads

314