Frequencies in Forgetful Timed Automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Frequencies in Forgetful Timed Automata


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
Origin : Files produced by the author(s)

Dates and versions

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


  • HAL Id : hal-00744081 , version 1


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⟩


71 View
65 Download


Gmail Facebook Twitter LinkedIn More