Frequencies in Forgetful Timed Automata

Abstract : A quantitative semantics for infinite timed words in timed automata based on the frequency of a run is introduced in [6]. Unfortunately, most of the results are obtained only for one-clock timed automata because the techniques do not allow to deal with some phenomenon of convergence between clocks. On the other hand, the notion of forgetful cycle is introduced in [4], in the context of entropy of timed languages, and seems to detect exactly these convergences. In this paper, we investigate how the notion of forgetfulness can help to extend the computation of the set of frequencies to n-clock timed automata.
Type de document :
Communication dans un congrès
M. Jurdzinski and D. Nickovic. Formal Modeling and Analysis of Timed Systems, Sep 2012, London, United Kingdom. Springer, 7595, pp.236-251, 2012, Lecture notes in computer science
Liste complète des métadonnées

Littérature citée [13 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00744081
Contributeur : Amélie Stainer <>
Soumis le : lundi 22 octobre 2012 - 11:53:17
Dernière modification le : mercredi 14 décembre 2016 - 01:06:07
Document(s) archivé(s) le : mercredi 23 janvier 2013 - 03:36:44

Fichier

versionfinale.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00744081, version 1

Collections

Citation

Amélie Stainer. Frequencies in Forgetful Timed Automata. M. Jurdzinski and D. Nickovic. Formal Modeling and Analysis of Timed Systems, Sep 2012, London, United Kingdom. Springer, 7595, pp.236-251, 2012, Lecture notes in computer science. 〈hal-00744081〉

Partager

Métriques

Consultations de la notice

104

Téléchargements de fichiers

49