# On timed automata with input-determined guards

Abstract : We consider a general notion of timed automata with input-determined guards and show that they admit a robust logical framework along the lines of [D 'Souza03], in terms of a monadic second order logic characterisation and an expressively complete timed temporal logic. We then generalize these automata using the notion of recursive operators introduced by Henzinger, Raskin, and Schobbens, and show that they admit a similar logical framework. These results hold in the pointwise'' semantics. We finally use this framework to show that the real-time logic MITL of Alur et al is expressively complete with respect to an MSO corresponding to an appropriate input-determined operator.
keyword :
Type de document :
Communication dans un congrès
yassine Lakhnech. Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems, Sep 2004, France. springer-verlag, Volume 3253/2004, pp.68-83, 2004, 〈10.1007/b100824〉

Littérature citée [15 références]

https://hal.archives-ouvertes.fr/hal-00017462
Contributeur : Nicolas Tabareau <>
Soumis le : lundi 23 janvier 2006 - 10:07:44
Dernière modification le : mardi 11 octobre 2016 - 14:09:14
Document(s) archivé(s) le : samedi 3 avril 2010 - 21:39:25

### Citation

Deepak D'Souza, Nicolas Tabareau. On timed automata with input-determined guards. yassine Lakhnech. Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems, Sep 2004, France. springer-verlag, Volume 3253/2004, pp.68-83, 2004, 〈10.1007/b100824〉. 〈hal-00017462〉

Consultations de
la notice

## 109

Téléchargements du document