Skip to Main content Skip to Navigation

Logiques pour les systèmes temporisés : contrôle et expressivité

Abstract : In the framework of formal verification of programs, we study systems interacting with an environment, and which must be guided or controlled to satisfy their specifications. For modelling timing properties, we study hybrid systems and real time logics. We study weighted o minimal hybrid systems and show that this model is expressive though analysable, as model checking and optimal control are decidable, whereas these problems are undecidable for timed automata. We also consider real time logics and show that the logic TPTL is strictly more expressive than MTL, proving a conjecture stated by Alur and Henzinger at the beginning of the 90s. Finally we obtain generic expressivity results between automata and logics, which can be applied in particular to MTL+Past.
Complete list of metadatas
Contributor : Ens Cachan Bibliothèque <>
Submitted on : Wednesday, December 19, 2007 - 11:05:13 AM
Last modification on : Monday, February 15, 2021 - 10:48:45 AM
Long-term archiving on: : Monday, April 12, 2010 - 8:28:12 AM


  • HAL Id : tel-00199604, version 1



Fabrice Chevalier. Logiques pour les systèmes temporisés : contrôle et expressivité. Réseaux et télécommunications [cs.NI]. École normale supérieure de Cachan - ENS Cachan, 2007. Français. ⟨tel-00199604⟩



Record views


Files downloads