Advertisement

Quantales and Temporal Logics

  • Bernhard Möller
  • Peter Höfner
  • Georg Struth
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4019)

Abstract

We propose an algebraic semantics for the temporal logic CTL * and simplify it for its sublogics CTL and LTL. We abstractly represent state and path formulas over transition systems in Boolean left quantales. These are complete lattices with a multiplication that preserves arbitrary joins in its left argument and is isotone in its right argument. Over these quantales, the semantics of CTL * formulas can be encoded via finite and infinite iteration operators; the CTL and LTL operators can be related to domain operators. This yields interesting new connections between representations as known from the modal μ-calculus and Kleene/ω-algebra.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Backhouse, R.C., et al.: Fixed point calculus. Inform. Proc. Letters 53, 131–136 (1995)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Cohen, E.: Separation and reduction. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol. 1837, pp. 45–59. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  3. 3.
    Conway, J.H.: Regular algebra and finite machines. Chapman and Hall, London (1971)zbMATHGoogle Scholar
  4. 4.
    Desharnais, J., Möller, B.: Characterizing determinacy in Kleene algebra. Special Issue on Relational Methods in Computer Science, Information Sciences — An International Journal 139, 253–273 (2001)zbMATHGoogle Scholar
  5. 5.
    Desharnais, J., Möller, B., Struth, G.: Modal Kleene algebra and applications — a survey. J. Relational Methods in Computer Science 1, 93–131 (2004)Google Scholar
  6. 6.
    Desharnais, J., Möller, B., Struth, G.: Kleene algebra with domain. ACM Transactions on Computational Logic (to appear, 2006)Google Scholar
  7. 7.
    Desharnais, J., Möller, B., Struth, G.: Termination in modal Kleene algebra. In: Lévy, J.-J., Mayr, E., Mitchell, J. (eds.) Exploring new frontiers of theoretical informatics. IFIP International Federation for Information Processing Series, vol. 155, pp. 653–666. Kluwer, Dordrecht (2004)CrossRefGoogle Scholar
  8. 8.
    Dijkstra, R.M.: Computation calculus bridging a formalisation gap. Science of Computer Programming 37, 3–36 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Emerson, E.A.: Temporal and modal logic. In: van Leeuwen, J. (ed.) Handbook of theoretical computer science. Formal models and semantics, vol. B, pp. 995–1072. Elsevier, Amsterdam (1991)Google Scholar
  10. 10.
    Frías, M.F., Lopez Pombo, C.: Interpretability of linear time temporal logic in fork algebra. Journal of Logic and Algebraic Programming 66(2), 161–184 (2006)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Goranko, V.: Temporal logics of computations. In: Introductory course, 12th European summer School in Logic, Language and Information, Birmingham, August 6–18 (2000)Google Scholar
  12. 12.
    Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press, Cambridge (2000)zbMATHGoogle Scholar
  13. 13.
    Höfner, P., Möller, B., Solin, K.: Omega Algebra, demonic refinement algebra and commands. In: Proc. 9th RelMiCS/4th AKA (to appear, 2006) Google Scholar
  14. 14.
    Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation 110(2), 366–390 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Kozen, D.: Kleene algebras with tests. ACM TOPLAS 19, 427–443 (1997)CrossRefGoogle Scholar
  16. 16.
    Kozen, D.: Some results in dynamic model theory. Science of Computer Programming 51, 3–22 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Möller, B.: Kleene getting lazy. In: Kozen, D. (ed.) MPC 2004. LNCS, vol. 3125, pp. 252–273. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  18. 18.
    Möller, B., Struth, G.: Algebras of Modal Operators and Partial Correctness. Theoretical Computer Science 351, 221–239 (2006)zbMATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    Möller, B., Struth, G.: wp is wlp. In: MacCaull, W., Winter, M., Düntsch, I. (eds.) RelMiCS 2005. LNCS, vol. 3929, pp. 200–211. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  20. 20.
    Rosenthal, K.I.: Quantales and their applications. Pitman Research Notes in Mathematics Series, vol. 234. Longman Scientific&Technical (1990)Google Scholar
  21. 21.
    Schmidt, G., Ströhlein, T.: Relations and Graphs — Discrete Mathematics for Computer Scientists. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1993)zbMATHGoogle Scholar
  22. 22.
    Staiger, L.: Omega languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of formal languages, vol. 3, pp. 339–387. Springer, Heidelberg (1997)Google Scholar
  23. 23.
    von Karger, B.: Temporal algebra. Mathematical Structures in Computer Science 8, 277–320 (1998)zbMATHCrossRefGoogle Scholar
  24. 24.
    von Karger, B., Berghammer, R.: A relational model for temporal logic. Logic Journal of the IGPL 6, 157–173 (1998)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Bernhard Möller
    • 1
  • Peter Höfner
    • 1
  • Georg Struth
    • 2
  1. 1.Institut für InformatikUniversität AugsburgAugsburgGermany
  2. 2.Department of Computer ScienceUniversity of SheffieldSheffieldUK

Personalised recommendations