Volume and Entropy of Regular Timed Languages: Discretization Approach

For timed languages, we define size measures: 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, we give exact formulas for volumes. Next, for a large class of timed languages accepted by non-Zeno timed automata, we devise a method to approximate the volumes and the entropy based on discretization. We give an information-theoretic interpretation of the entropy in terms of Kolmogorov complexity.

[1]  Cristobal Rojas.  Computability and information in models of randomness and chaos , 2008, Math. Struct. Comput. Sci..

[2]  Robert de Simone,et al.  CONCUR'98 Concurrency Theory , 1998, Lecture Notes in Computer Science.

[3]  G. Bucci,et al.  Introducing probability within state class analysis of dense-time-dependent systems , 2005, Second International Conference on the Quantitative Evaluation of Systems (QEST'05).

[4]  Nathalie Bertrand,et al.  Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics , 2008, 2008 Fifth International Conference on Quantitative Evaluation of Systems.

[5]  Oded Maler,et al.  On timed components and their abstraction , 2007, SAVCBS '07.

[6]  Amir Pnueli,et al.  On Discretization of Delays in Timed Automata and Digital Circuits , 1998, CONCUR.

[7]  E. Asarin,et al.  Volume and entropy of regular timed languages , 2009 .

[8]  Douglas Lind,et al.  An Introduction to Symbolic Dynamics and Coding , 1995 .

[9]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[10]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[11]  Thomas A. Henzinger,et al.  What Good Are Digital Clocks? , 1992, ICALP.

[12]  E. Vicario,et al.  Close form derivation of state-density functions over DBM domains in the analysis of non-Markovian models , 2007 .

[13]  Paul Caspi,et al.  Timed regular expressions , 2002, JACM.

[14]  P. Varaiya,et al.  Discretization of timed automata , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[15]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[16]  A. Kolmogorov.  Three approaches to the quantitative definition of information , 1968 .

[17]  Eugene Asarin,et al.  Volume and Entropy of Regular Timed Languages: Analytic Approach , 2009, FORMATS.