Volume and entropy of regular timed languages - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2009

Volume and entropy of regular timed languages


For timed languages, we define measures of their size: volume for a fixed finite number of events, and entropy (growth rate) as asymptotic measure for an unbounded number of events. These measures can be used for comparison of languages, and the entropy can be viewed as information contents of a timed language. In case of languages of deterministic timed automata, we give exact formulas for volumes. Next we characterize the entropy, using methods of functional analysis, as a logarithm of the leading eigenvalue (spectral radius) of a positive integral operator. We devise several methods to compute the entropy: a symbolical one for so-called “1,5 -clock” automata, and two numerical ones: one using techniques of functional analysis, another based on discretization.
Fichier principal
Vignette du fichier
volume.pdf (274.05 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00369812 , version 1 (21-03-2009)
hal-00369812 , version 2 (23-06-2009)
hal-00369812 , version 3 (09-07-2009)


  • HAL Id : hal-00369812 , version 3


Eugene Asarin, Aldric Degorre. Volume and entropy of regular timed languages. 2009. ⟨hal-00369812v3⟩
552 View
193 Download


Gmail Facebook X LinkedIn More