Skip to main content
Springer Nature Link
Log in

On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics

  • Conference paper
  • First Online:
LATIN 2000: Theoretical Informatics (LATIN 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1776))

Included in the following conference series:

Abstract

We investigate extensions of CTL allowing to express quantitative requirements about an abstract notion of time in a simple discrete-time framework, and study the expressive power of several relevant logics.

When only subscripted modalities are used, polynomial-time model checking is possible even for the largest logic we consider, while introducing freeze quantifiers leads to a complexity blow-up.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Alur, R., Courcoubetis, C., Dill, D.: Model-checking for real-time systems. In: Proc. 5th IEEE Symp. Logic in Computer Science (LICS 1990), Philadelphia, PA, USA, pp. 414–425 (June 1990)

    Google Scholar 

  2. Alur, R., Courcoubetis, C., Dill, D.: Model-checking in dense real-time. Information and Computation 104(1), 2–34 (1993)

    Article  MathSciNet  Google Scholar 

  3. Alur, R., Henzinger, T.A.: A really temporal logic. Journal of the ACM 41(1), 181–203 (1994)

    Article  MathSciNet  Google Scholar 

  4. Aceto, L., Laroussinie, F.: Is your model checker on time? In: Kutyłowski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol. 1672, pp. 125–136. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  5. Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic model checking: 1020 states and beyond. Information and Computation 98(2), 142–170 (1992)

    Article  MathSciNet  Google Scholar 

  6. Demri, S., Schnoebelen, P.: The complexity of propositional linear temporal logics in simple cases (extended abstract). In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol. 1373, pp. 61–72. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  7. Emerson, E.A.: Temporal and modal logic. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 16, vol. B, pp. 995–1072. Elsevier Science, Amsterdam (1990)

    Google Scholar 

  8. Emerson, E.A., Mok, A.K., Sistla, A.P., Srinivasan, J.: Quantitative temporal reasoning. In: Clarke, E., Kurshan, R.P. (eds.) CAV 1990. LNCS, vol. 531, pp. 136–145. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  9. Emerson, E.A., Trefler, R.J.: Generalized quantitative temporal reasoning: An automatatheoretic approach. In: Bidoit, M., Dauchet, M. (eds.) CAAP 1997, FASE 1997, and TAPSOFT 1997. LNCS, vol. 1214, pp. 189–200. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  10. Emerson, E.A., Trefler, R.J.: Parametric quantitative temporal reasoning. In: Proc. 14th IEEE Symp. Logic in Computer Science (LICS 1999), Trento, Italy, pp. 336–343 (1999)

    Google Scholar 

  11. Kupferman, O., Vardi, M.Y., Wolper, P.: An automata-theoretic approach to branching-time model checking (1998); Full version of the CAV 1994 paper, accepted for publication in J. ACM

    Google Scholar 

  12. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.

    Google Scholar 

  13. T. Wilke. CTL+ is exponentially more succint than CTL. In Proc. 19th Conf. Found. of Software Technology and Theor. Comp. Sci. (FST&TCS’99), Chennai, India, Dec. 1999, volume 1738 of Lecture Notes in Computer Science. Springer, 1999.

    Google Scholar 

  14. J. Yang, A. K. Mok, and F. Wang. Symbolic model checking for event-driven real-time systems. ACMTransactions on Programming Languages and Systems, 19(2):386–412, 1997.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lab. Spécification, & Vérification, ENS de Cachan & CNRS UMR 8643, 61, av. Pdt. Wilson, 94235, Cachan Cedex, France

    F. Laroussinie, Ph. Schnoebelen & M. Turuani

Authors
  1. F. Laroussinie
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ph. Schnoebelen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Turuani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. ETH Zurich, Institute of Computational Science, CH-8092 Zurich and, Swiss Institute of Bioinformatics, Switzerland

    Gaston H. Gonnet

  2. Pedeciba Informática, Casilla de Correo 16120, Distrito 6, Montevideo, Uruguay

    Alfredo Viola

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Laroussinie, F., Schnoebelen, P., Turuani, M. (2000). On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics. In: Gonnet, G.H., Viola, A. (eds) LATIN 2000: Theoretical Informatics. LATIN 2000. Lecture Notes in Computer Science, vol 1776. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10719839_43

Download citation

  • DOI: https://doi.org/10.1007/10719839_43

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67306-4

  • Online ISBN: 978-3-540-46415-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics