 |
|
|
|
| HAL : hal-00017462, version 1 |
| arXiv : cs.LO/0601096 |
| DOI : 10.1007/b100824 |
| Fiche détaillée |  Récupérer au format |
|
|
| Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems, France (2004) |
|
|
|
|
| On timed automata with input-determined guards |
|
|
| Deepak D'Souza 1Nicolas Tabareau 2 |
|
|
| (07/12/2004) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Dept of Computer Science and Automation |
|
|
|
Indian Institute of Science |
|
|
| 2 : | Preuves, Programmes et Systèmes (PPS) |
|
|
|
CNRS : UMR7126 – Université Paris VII - Paris Diderot |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Logique en informatique |
|
|
| timed automata – monadic second-order logic – real-time temporal logics |
|
|
|
|
|
| hal-00017462, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00017462 | |
| oai:hal.archives-ouvertes.fr:hal-00017462 | |
| Contributeur : Nicolas Tabareau | |
| Soumis le : Lundi 23 Janvier 2006, 10:07:44 | |
| Dernière modification le : Mardi 23 Mars 2010, 11:55:34 | |
