Skip to main content
SpringerLink
Log in
Book cover

International Conference on Concurrency Theory

CONCUR 2009: CONCUR 2009 - Concurrency Theory pp 69–83Cite as

Volume and Entropy of Regular Timed Languages: Discretization Approach

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5710))

Abstract

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.

Support from French ANR project AMAES is gratefully acknowledged.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ben Salah, R., Bozga, M., Maler, O.: On timed components and their abstraction. In: SAVCBS 2007, pp. 63–71. ACM, New York (2007)

    Google Scholar 

  2. Asarin, E., Degorre, A.: Volume and entropy of regular timed languages: Analytic approach. In: FORMATS 2009. LNCS. Springer, Heidelberg (to appear, 2009)

    Google Scholar 

  3. Asarin, E., Degorre, A.: Volume and entropy of regular timed languages. Preprint (2009), http://hal.archives-ouvertes.fr/hal-00369812/

  4. Lind, D., Marcus, B.: An introduction to symbolic dynamics and coding. Cambridge University Press, Cambridge (1995)

    Book  MATH  Google Scholar 

  5. Bucci, G., Piovosi, R., Sassoli, L., Vicario, E.: Introducing probability within state class analysis of dense-time-dependent systems. In: QEST 2005, pp. 13–22. IEEE Computer Society, Los Alamitos (2005)

    Google Scholar 

  6. Sassoli, L., Vicario, E.: Close form derivation of state-density functions over dbm domains in the analysis of non-Markovian models. In: QEST 2007, pp. 59–68. IEEE Computer Society, Los Alamitos (2007)

    Google Scholar 

  7. Bertrand, N., Bouyer, P., Brihaye, T., Markey, N.: Quantitative model-checking of one-clock timed automata under probabilistic semantics. In: QEST 2008, pp. 55–64. IEEE Computer Society, Los Alamitos (2008)

    Google Scholar 

  8. Asarin, E., Pokrovskii, A.: Use of the Kolmogorov complexity in analyzing control system dynamics. Automation and Remote Control (1), 25–33 (1986)

    Google Scholar 

  9. Rojas, C.: Computability and information in models of randomness and chaos. Mathematical Structures in Computer Science 18(2), 291–307 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  10. Brudno, A.: Entropy and the complexity of the trajectories of a dynamical system. Trans. Moscow Math. Soc. 44, 127–151 (1983)

    MATH  Google Scholar 

  11. Asarin, E., Caspi, P., Maler, O.: Timed regular expressions. Journal of the ACM 49, 172–206 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  12. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126, 183–235 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  13. Asarin, E., Maler, O., Pnueli, A.: On discretization of delays in timed automata and digital circuits. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 470–484. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  14. Henzinger, T.A., Manna, Z., Pnueli, A.: What good are digital clocks? In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 545–558. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  15. Göllü, A., Puri, A., Varaiya, P.: Discretization of timed automata. In: CDC 1994, vol. 1, pp. 957–958 (1994)

    Google Scholar 

  16. Kolmogorov, A.: Three approaches to the quantitative definition of information. Problems of Information Transmission 1(1), 1–7 (1965)

    MathSciNet  MATH  Google Scholar 

  17. Li, M., Vitányi, P.: An introduction to Kolmogorov complexity and its applications, 3rd edn. Springer, Heidelberg (2008)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIAFA, Université Paris Diderot / CNRS, case 7014, 75205, Paris Cedex 13, France

    Eugene Asarin

  2. VERIMAG, Centre Equation, 2 av. de Vignate, 38610, Gières, France

    Aldric Degorre

Authors
  1. Eugene Asarin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aldric Degorre
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Bologna, Mura A. Zamboni 7, 40127, Bologna, Italy

    Mario Bravetti  & Gianluigi Zavattaro  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Asarin, E., Degorre, A. (2009). Volume and Entropy of Regular Timed Languages: Discretization Approach. In: Bravetti, M., Zavattaro, G. (eds) CONCUR 2009 - Concurrency Theory. CONCUR 2009. Lecture Notes in Computer Science, vol 5710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04081-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04081-8_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04080-1

  • Online ISBN: 978-3-642-04081-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation