Skip to main content
SpringerLink
Log in

Generating Functions of Timed Languages

  • Conference paper
Mathematical Foundations of Computer Science 2012 (MFCS 2012)

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

Abstract

In order to study precisely the growth of timed languages, we associate to such a language a generating function. These functions (tightly related to volume and entropy of timed languages) satisfy compositionality properties and, for deterministic timed regular languages, can be characterized by integral equations. We provide procedures for closed-form computation of generating functions for some classes of timed automata and regular expressions.

The support of Agence Nationale de la Recherche under the project EQINOCS (ANR-11-BS02-004) is gratefully acknowledged.

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

Access this chapter

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 89.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MathSciNet  MATH  Google Scholar 

  2. Asarin, E., Basset, N., Degorre, A., Perrin, D.: Generating functions of timed languages. Tech. rep (2012), http://hal.archives-ouvertes.fr/hal-00678443

  3. Asarin, E., Degorre, A.: Volume and Entropy of Regular Timed Languages: Analytic Approach. In: Ouaknine, J., Vaandrager, F.W. (eds.) FORMATS 2009. LNCS, vol. 5813, pp. 13–27. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Asarin, E., Degorre, A.: Volume and Entropy of Regular Timed Languages: Discretization Approach. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 69–83. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  5. Basset, N., Asarin, E.: Thin and Thick Timed Regular Languages. In: Fahrenberg, U., Tripakis, S. (eds.) FORMATS 2011. LNCS, vol. 6919, pp. 113–128. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  6. Berstel, J., Reutenauer, C.: Noncommutative rational series with applications. Enc. of Math. and Appl., vol. 137. Cambridge University Press (2011)

    Google Scholar 

  7. Bouyer, P., Petit, A.: A Kleene/Büchi-like theorem for clock languages. Journal of Automata, Languages and Combinatorics 7(2), 167–186 (2002)

    MathSciNet  MATH  Google Scholar 

  8. Flajolet, P., Sedgewick, R.: Analytic combinatorics. Cambridge University Press (2009)

    Google Scholar 

  9. Salomaa, A., Soittola, M.: Automata-theoretic aspects of formal power series. Springer (1978)

    Google Scholar 

  10. 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 (2007)

    Google Scholar 

  11. Stanley, R.P.: A survey of alternating permutations. In: Combinatorics and graphs. Contemp. Math., vol. 531, pp. 165–196. Amer. Math. Soc., Providence (2010)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIAFA, University Paris Diderot and CNRS, France

    Eugene Asarin & Aldric Degorre

  2. LIGM, University Paris-Est Marne-la-Vallée and CNRS, France

    Nicolas Basset & Dominique Perrin

Authors
  1. Eugene Asarin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nicolas Basset
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Aldric Degorre
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dominique Perrin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Comenius University, Mlynska Dolina, 84248, Bratislava, Slovakia

    Branislav Rovan

  2. Department of Electronics and Computer Science, University of Southampton, SO17 1BJ, Southampton, UK

    Vladimiro Sassone

  3. Institute of Theoretical Computer Science, ETH Zürich, CAB H 39.2, Universitätstrasse 6, 8092, Zürich, Switzerland

    Peter Widmayer

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Asarin, E., Basset, N., Degorre, A., Perrin, D. (2012). Generating Functions of Timed Languages. In: Rovan, B., Sassone, V., Widmayer, P. (eds) Mathematical Foundations of Computer Science 2012. MFCS 2012. Lecture Notes in Computer Science, vol 7464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32589-2_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32589-2_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32588-5

  • Online ISBN: 978-3-642-32589-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation