Stainer12

A. Stainer. Frequencies in Forgetful Timed Automata. Research Report INRIA, No 8009, 2012.

Download [help]

Download paper: Adobe portable document (pdf)

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
This page is automatically generated by bib2html v216, © INRIA 2002-2007, Projet Lagadic

Abstract

A quantitative semantics for infinite timed words in timed automata based on the frequency of a run is introduced in [BBBS11]. 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 [BA11], in the context of entropy of timed languages, and seems to detect exactly these con- vergences. 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

Contact

Amélie Stainer http://www.irisa.fr/prive/amelie.stainer/

BibTex Reference

@TechReport{Stainer12,
   Author = {Stainer, A.},
   Title = {Frequencies in Forgetful Timed Automata},
   Number = {8009},
   Institution = {INRIA},
   Year = {2012}
}

EndNote Reference [help]

Get EndNote Reference (.ref)