On timed automata with input-determined guards - Archive ouverte HAL Access content directly
Conference Papers Year : 2004

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.
Fichier principal
Vignette du fichier
idta.pdf (239.45 Ko) Télécharger le fichier
Loading...

Dates and versions

hal-00017462 , version 1 (23-01-2006)

Identifiers

Cite

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⟩
99 View
183 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More