Advertisement

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

  • F. Laroussinie
  • Ph. Schnoebelen
  • M. Turuani
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1776)

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.

Keywords

Model Check Temporal Logic Expressive Power Linear Temporal Logic Atomic Proposition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 2.
    Alur, R., Courcoubetis, C., Dill, D.: Model-checking in dense real-time. Information and Computation 104(1), 2–34 (1993)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Alur, R., Henzinger, T.A.: A really temporal logic. Journal of the ACM 41(1), 181–203 (1994)MathSciNetCrossRefGoogle Scholar
  4. 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)CrossRefGoogle Scholar
  5. 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)MathSciNetCrossRefGoogle Scholar
  6. 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)CrossRefGoogle Scholar
  7. 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. 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)CrossRefGoogle Scholar
  9. 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)CrossRefGoogle Scholar
  10. 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. 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. ACMGoogle Scholar
  12. 12.
    C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994. Google Scholar
  13. 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. 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.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • F. Laroussinie
    • 1
  • Ph. Schnoebelen
    • 1
  • M. Turuani
    • 1
  1. 1.Lab. Spécification, & VérificationENS de Cachan & CNRS UMR 8643Cachan CedexFrance

Personalised recommendations