Skip to Main content Skip to Navigation

Spécification et vérification de propriétés quantitatives sur des automates à contraintes

Abstract : The ubiquity of computer systems in everyday life impose to ensure their good behavior. The use of formal verification methods allows to supply simulations that cannot be exhaustive because of the large amount of possible scenarios. Model checking is a technique to verify automatically computer systems which consists in developing algorithme to check that a specification usually expressed by some logical formula is satisfied by a model of the system. Historical specification languages use propositional variables as atomic formulas, which allows to state properties only on the control locations of the models. In this thesis, we aim at checking richer properties on the data that models can handle: counters, clocks or queues. These data have an infinite interpretation domain and so the corresponding models have an infinite amount of states. We define a general framework for the extension of temporal logics with constraints allowing to compare values of the variables at different states of an execution. We establish decidability and complexity results for model checking problems involving several instances of such extensions. We mainly use automata base techniques combining usual constructions with abstraction methods for infinite data.
Document type :
Complete list of metadatas
Contributor : Ens Cachan Bibliothèque <>
Submitted on : Wednesday, December 16, 2009 - 11:43:31 AM
Last modification on : Thursday, July 2, 2020 - 5:26:02 PM
Long-term archiving on: : Thursday, June 17, 2010 - 11:45:37 PM


  • HAL Id : tel-00441504, version 1



Régis Gascon. Spécification et vérification de propriétés quantitatives sur des automates à contraintes. Informatique [cs]. École normale supérieure de Cachan - ENS Cachan, 2007. Français. ⟨tel-00441504⟩



Record views


Files downloads