The Stuttering Principle Revisited: On the Expressiveness of Nested X and ⋃ Operators in the Logic LTL

  • Antonín Kucera
  • Jan Strejček
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2471)

Abstract

It is known that LTL formulae without the ‘next’ operator are invariant under the so-called stutter-equivalence of words. In this paper we extend this principle to general LTL formulae with given nesting depths of the ‘next’ and ‘until’ operators. This allows us to prove the semantical strictness of three natural hierarchies of LTL formulae, which are parametrized either by the nesting depth of just one of the two operators, or by both of them. As another interesting corollary we obtain an alternative characterization of LTL languages, which are exactly the regular languages closed under the generalized form of stutter equivalence. We also indicate how to tackle the state-space explosion problem with the help of presented results

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [CGP99]
    E.M. Clark, O. Grumberg, and D.A. Peled. Model Checking. The MIT Press, 1999.Google Scholar
  2. [EW00]
    K. Etessami and T. Wilke. An until hierarchy and other applications of an Ehrenfeucht-FraΫissé game for temporal logic. Information and Computation, 160:88–108, 2000.MATHCrossRefMathSciNetGoogle Scholar
  3. [Kam68]
    H. Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, UCLA, 1968.Google Scholar
  4. [Lam83]
    L. Lamport. What good is temporal logic? In Proceedings of IFIP Congress on Information Processing, pages 657–667, 1983.Google Scholar
  5. [MP71]
    R. McNaughton and S. Papert. Counter-Free Automata. The MIT Press, 1971.Google Scholar
  6. [Pnu77]
    A. Pnueli. The temporal logic of programs. In Proceedings of 18th Annual Symposium on Foundations of Computer Science, pages 46–57. IEEE Computer Society Press, 1977.Google Scholar
  7. [Tho91]
    W. Thomas. Automata on infinite objects. Handbook of Theoretical Computer Science, B:135–192, 1991.Google Scholar
  8. [Wil99]
    T. Wilke. Classifying discrete temporal properties. In Proceedings of STACS’99, volume 1563 of LNCS, pages 32–46. Springer, 1999.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Antonín Kucera
    • 1
  • Jan Strejček
    • 1
  1. 1.Faculty of InformaticsMasaryk UniversityBrnoCzech Republic

Personalised recommendations