Advertisement

Nesting Until and Since in Linear Temporal Logic

  • Denis Thérien
  • Thomas Wilke
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2285)

Abstract

We provide an effective characterization of the “until-since hierarchy” of linear temporal logic, that is, we show how to compute for a given temporal property the minimal nesting depth in “until” and “since” required to express it. This settles the most prominent classi- fication problem for linear temporal logic. Our characterization of the individual levels of the “until-since hierarchy” is algebraic: for each n, we present a decidable class of finite semigroups and show that a temporal property is expressible with nesting depth at most n if and only if the syntactic semigroup of the formal language associated with the property belongs to the class provided. The core of our algebraic characterization is a new description of substitution in linear temporal logic in terms of block products of finite semigroups.

Keywords

Temporal Logic Wreath Product Linear Temporal Logic Propositional Variable Semigroup Variety 
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. [Alm95]
    Jorge Almeida. Finite Semigroups and Universal Algebra, volume 3 of Series in Algebra. World Scientific, Singapore, 1995.Google Scholar
  2. [Alm96]
    Jorge Almeida. A syntactical proof of locality of DA. Internat. J. Algebra and Comput., 6(2):165–177, 1996.zbMATHCrossRefMathSciNetGoogle Scholar
  3. [CC89]
    Joëlle Cohen-Chesnot. Etude algébrique de la logique temporelle. Doctoral thesis, Université Paris 6, Paris, France, April 1989.Google Scholar
  4. [CPP93]
    Joëlle Cohen, Dominique Perrin, and Jean-Eric Pin. On the expressive power of temporal logic. J. Comput. System Sci., 46(3):271–294, June 1993.zbMATHCrossRefMathSciNetGoogle Scholar
  5. [Eil76]
    Samuel Eilenberg. Automata, Languages, and Machines, volume 59-B of Pure and Applied Mathematics. Academic Press, New York, 1976.Google Scholar
  6. [Eme90]
    Allen E. Emerson. Temporal and modal logic. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Methods and Semantics, pages 995–1072. Elsevier Science Publishers B. V., Amsterdam, 1990.Google Scholar
  7. [EVW97]
    Kousha Etessami, Moshe Y. Vardi, and Thomas Wilke. First-order logic with two variables and unary temporal logic. In Proceedings 12th Annual IEEE Symposium on Logic in Computer Science, pages 228–235, Warsaw, Poland, 1997.Google Scholar
  8. [EW96]
    Kousha Etessami and Thomas Wilke. An until hierarchy for temporal logic. In Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, pages 108–117, New Brunswick, N. J., 1996.Google Scholar
  9. [Kam68]
    Johan Anthony Willem Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Los Angeles, Calif., 1968.Google Scholar
  10. [Krö87]
    Fred Kröger. Temporal Logic of Programs. Springer, 1987.Google Scholar
  11. [Lam83]
    Leslie Lamport. Specifying concurrent program modules. ACMT rans. Programming Lang. Sys., 5(2):190–222, 1983.zbMATHCrossRefGoogle Scholar
  12. [MAB+94]
    Zohar Manna, Anuchit Anuchitanukul, Nikolaj Bjørner, Anca Browne, Edward Chang, Michael Colón, Luca de Alfaro, Harish Devarajan, Henny Sipma, and Tomas Uribe. STeP: the Stanford Temporal Prover. Technical Report STAN-CS-TR-94-1518, Dept. of Computer Science, Stanford University, Stanford, Calif., 1994.Google Scholar
  13. [Pnu77]
    Amir Pnueli. The temporal logic of programs. In 18th Annual Symposium on Foundations of Computer Science, pages 46–57, Rhode Island, Providence, 1977.Google Scholar
  14. [Ste99]
    Ben Steinberg. Semidirect products of categories and applications. Journal of Pure and Applied Algebra, 142:153–182, 1999.zbMATHCrossRefMathSciNetGoogle Scholar
  15. [Str85]
    Howard Straubing. Finite semigroup varieties of the form V.D. J. Pure Appl. Algebra, 36:53–94, 1985.zbMATHCrossRefMathSciNetGoogle Scholar
  16. [SZ87]
    A. Prasad Sistla and Lenore D. Zuck. On the eventuality operator in temporal logic. In Proceedings, Symposium on Logic in Computer Science, pages 153–166, Ithaca, New York, June 1987.Google Scholar
  17. [SZ93]
    A. Prasad Sistla and Lenore D. Zuck. Reasoning in a restricted temporal logic. Inform. and Computation, 102(2):167–195, February 1993.zbMATHCrossRefMathSciNetGoogle Scholar
  18. [Thé91]
    Denis Thérien. Two-sided wreath product of categories. Journal of Pure and Applied Algebra, 74:307–315, 1991.zbMATHCrossRefMathSciNetGoogle Scholar
  19. [TW96]
    Denis Thérien and Thomas Wilke. Temporal logic and semidirect products: An effective characterization of the until hierarchy. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pages 256–263, Burlington, Vermont, 1996.Google Scholar
  20. [TW98]
    Denis Thérien and Thomas Wilke. Over words, two variables are as powerful as one quantifier alternation: FO2 = ∑2∩∏2. In Proceedings of the Thirtieth Annual ACMSymp osium on Theory of Computing, pages 41–47, Dallas, Texas, May 1998.Google Scholar
  21. [Til87]
    Brat Tilson. Categories as algebra. J. Pure Appl. Algebra, 48:83–198, 1987.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Denis Thérien
    • 1
  • Thomas Wilke
    • 2
  1. 1.School of Computer ScienceMcGill UniversityMontréalCanada
  2. 2.Computer Science DepartmentCAUKielGermany

Personalised recommendations