Frequencies in Forgetful Timed Automata - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Frequencies in Forgetful Timed Automata

Résumé

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.
Fichier principal
Vignette du fichier
versionfinale.pdf (212.73 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00744081 , version 1 (22-10-2012)

Identifiants

  • HAL Id : hal-00744081 , version 1

Citer

Amélie Stainer. Frequencies in Forgetful Timed Automata. Formal Modeling and Analysis of Timed Systems, Sep 2012, London, United Kingdom. pp.236-251. ⟨hal-00744081⟩

Collections

INRIA INRIA2
71 Consultations
67 Téléchargements

Partager

Gmail Facebook X LinkedIn More