On the expressivity and complexity of quantitative branching-time temporal logics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1776 LNCS, Issue , 2000, Pages 437-446

  Laroussinie, F ^a   Schnoebelen, P ^a   Turuani, M ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT NOTIONS; BLOW-UP; EXPRESSIVE POWER; FREEZE QUANTIFIERS; POLYNOMIAL-TIME; RELEVANT LOGIC; DISCRETE TIME;

MODEL CHECKING; INFORMATION SCIENCE; POLYNOMIAL APPROXIMATION;

INFORMATION SCIENCE; TEMPORAL LOGIC;

EID: 84896693714     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/10719839_43     Document Type: Article

References (14)

1. R. Alur, C. Courcoubetis, and D. Dill. Model-checking for real-time systems. In Proc. 5th IEEE Symp. Logic in Computer Science (LICS'90), Philadelphia, PA, USA, June 1990, pages 414-425, 1990.
2. R. Alur, C. Courcoubetis, and D. Dill. Model-checking in dense real-time. Information and Computation, 104(1):2-34, 1993.
3. R. Alur and T. A. Henzinger. A really temporal logic. Journal of the ACM, 41(1):181-203, 1994.
4. L. Aceto and F. Laroussinie. Is your model checker on time ? In Proc. 24th Int. Symp. Math. Found. Comp. Sci. (MFCS'99), Szklarska Poreba, Poland, Sep. 1999, Volume 1672 of Lecture Notes in Computer Science, pages 125-136. Springer, 1999.
5. 20 states and beyond. Information and Computation, 98(2):142-170, 1992.
6. S. Demri and Ph. Schnoebelen. The complexity of propositional linear temporal logics in simple cases (extended abstract). In Proc. 15th Ann. Symp. Theoretical Aspects of Computer Science (STACS'98), Paris, France, Feb. 1998, Volume 1373 of Lecture Notes in Computer Science, pages 61-72. Springer, 1998.
7. E.A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, vol. B, chapter 16, pages 995-1072. Elsevier Science, 1990.
8. E. A. Emerson, A. K. Mok, A. P. Sistla, and J. Srinivasan. Quantitative temporal reasoning. In Proc. 2nd Int. Workshop Computer-Aided Verification (CAV'90), New Brunswick, NJ, USA, June 1990, Volume 531 of Lecture Notes in Computer Science, pages 136-145. Springer, 1991.
9. E. A. Emerson and R. J. Trefler. Generalized quantitative temporal reasoning: An automata-theoretic approach. In Proc. 7th Int. Joint Conf. Theory and Practice of Software Development (TAPSOFT'97), Lille, France, Apr. 1997, Volume 1214 of Lecture Notes in Computer Science, pages 189-200. Springer, 1997.
10. E. A. Emerson and R. J. Trefler. Parametric quantitative temporal reasoning. In Proc. 14th IEEE Symp. Logic in Computer Science (LICS'99), Trento, Italy, July 1999, pages 336-343, 1999.
11. O. Kupferman, M.Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking, 1998. Full version of the CAV'94 paper, accepted for publication in J. ACM.
12. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
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.
14. J. Yang, A. K. Mok, and F. Wang. Symbolic model checking for event-driven real-time systems. ACM Transactions on Programming Languages and Systems, 19(2):386-412, 1997.