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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [13 references]  Display  Hide  Download
Contributor : Amélie Stainer <>
Submitted on : Monday, October 22, 2012 - 11:53:17 AM
Last modification on : Wednesday, April 11, 2018 - 1:52:07 AM
Document(s) archivé(s) le : Wednesday, January 23, 2013 - 3:36:44 AM


Files produced by the author(s)


  • 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⟩



Record views


Files downloads