Measuring information in timed languages

Authors:
Eugene Asarin
Affiliations:
LIAFA --- Université Paris Diderot and CNRS, France
Venue:
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Year:
2012

Citing 4
Cited 0

A theory of timed automata

Theoretical Computer Science
Volume and Entropy of Regular Timed Languages: Discretization Approach

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Volume and Entropy of Regular Timed Languages: Analytic Approach

FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Thin and thick timed regular languages

FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Timed automata and timed languages [1] constitute a beautiful discovery that opened new perspectives to automata and language theory, as well as new applications to computer-aided verification. However the theory of timed regular languages is far from being achieved. Seven years ago, in [2], I argued that developing such a theory constituted an important research challenge, and I sketched a research program in this direction. Unfortunately, when listing research tasks on timed languages I have overlooked one interesting topic: measuring size of and information content in such languages. Catching up this omission became the focus of my research and the theme of this talk.