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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00017462
Contributor : Nicolas Tabareau <>
Submitted on : Monday, January 23, 2006 - 10:07:44 AM
Last modification on : Friday, January 4, 2019 - 5:32:59 PM
Document(s) archivé(s) le : Saturday, April 3, 2010 - 9:39:25 PM

Files

Identifiers

Collections

Citation

Deepak d'Souza, Nicolas Tabareau. On timed automata with input-determined guards. Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems, Sep 2004, France. pp.68-83, ⟨10.1007/b100824⟩. ⟨hal-00017462⟩

Share

Metrics

Record views

192

Files downloads

166