Theoretical Computer Science
An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
Journal of the ACM (JACM)
Introducing Probability within State Class Analysis of Dense-Time-Dependent Systems
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
On timed components and their abstraction
Proceedings of the 2007 conference on Specification and verification of component-based systems: 6th Joint Meeting of the European Conference on Software Engineering and the ACM SIGSOFT Symposium on the Foundations of Software Engineering
QEST '07 Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics
QEST '08 Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems
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: Discretization Approach
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
Thin and thick timed regular languages
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
A linearly computable measure of string complexity
Theoretical Computer Science
Measuring information in timed languages
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Generating functions of timed languages
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Toward a timed theory of channel coding
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
As soon as probable: optimal scheduling under stochastic uncertainty
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A maximal entropy stochastic process for a timed automaton,
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Spectral gap in timed automata
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |
We have recently defined size measures for timed languages: volume for languages with words having 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 quantitative comparison of languages, and the entropy can be viewed as the information contents of a timed language. For languages accepted by deterministic timed automata, using methods of functional analysis, we characterize the entropy as the logarithm of the leading eigenvalue (spectral radius) of a positive integral operator. We devise two procedures to compute the entropy: a symbolic one for so-called "$1\, \frac{1}{2}$-clock" automata, using differential equations; and a numerical one based on iterations of an integral operator.