Advertisement

A more complete TLA

  • Stephan Merz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1709)

Abstract

This paper defines a generalization of Lamport’s Temporal Logic of Actions.We prove that our logic is stuttering-invariant and give an axiomatization of its propositional fragment. We also show that standard TLA is as expressive as our extension once quantification over flexible propositions is added.

Keywords

Induction Hypothesis Temporal Logic Propositional Logic Proof System 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.

References

  1. [1]
    Martín Abadi. An axiomatization of Lamport’s Temporal Logic of Actions. In Jos C. M. Baeten and Jan W. Klop, editors, CONCUR’ 90, Theories of Concurrency: Unification and Extension, volume 458 of Lecture Notes in Computer Science, pages 57–69, Berlin, 1990. Springer-Verlag. A revised version is available on the Web at http://www.research.digital. com/SRC/personal/Martin Abadi/allpapers.html.CrossRefGoogle Scholar
  2. [2]
    Martín Abadi and Leslie Lamport. The existence of refinement mappings. Theoretical Computer Science, 81(2):253–284, May 1991.CrossRefMathSciNetGoogle Scholar
  3. [3]
    Martín Abadi and Leslie Lamport. An old-fashioned recipe for real time. Research Report 91, Digital Equipment Corporation, Systems Research Center, 1992. An earlier version, without proofs, appeared in [7, pages 1–27].Google Scholar
  4. [4]
    Martín Abadi and Leslie Lamport. Conjoining specifications. ACM Transactions on Programming Languages and Systems, 17(3):507–534, May 1995.CrossRefGoogle Scholar
  5. [5]
    Martín Abadi and Stephan Merz. An abstract account of composition. In Jiří Wiedermann and Petr Hajek, editors, Mathematical Foundations of Computer Science, volume 969 of Lecture Notes in Computer Science, pages 499–508, Berlin, 1995. Springer-Verlag.Google Scholar
  6. [6]
    Martín Abadi and Stephan Merz. On TLA as a logic. In Manfred Broy, editor, Deductive Program Design, NATO ASI series F, pages 235–272. Springer-Verlag, Berlin, 1996.Google Scholar
  7. [7]
    J.W. de Bakker, C. Huizing, W. P. de Roever, and G. Rozenberg, editors. Real-Time: Theory in Practice, volume 600 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1992. Proceedings of a REX Real-TimeWorkshop, held in The Netherlands in June, 1991.CrossRefGoogle Scholar
  8. [8]
    Dov Gabbay, Amir Pnueli, S. Shelah, and Jonathan Stavi. On the temporal analysis of fairness. In Proceedings of the 7th Annual ACM Symposium on Principles of Programming Languages, pages 163–173. ACM, 1980.Google Scholar
  9. [9]
    Fred Kröger. Temporal Logic of Programs, volume 8 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, 1987.zbMATHGoogle Scholar
  10. [10]
    Leslie Lamport. What good is temporal logic? In R. E. A. Mason, editor, Information Processing 83: Proceedings of the IFIP 9th World Congress, pages 657–668, Paris, September 1983. IFIP, North-Holland.Google Scholar
  11. [11]
    Leslie Lamport. Hybrid systems in TLA+. In Robert L. Grossman, Anil Nerode, Anders P. Ravn, and Hans Rischel, editors, Hybrid Systems, volume 736 of Lecture Notes in Computer Science, pages 77–102. Springer-Verlag, 1993.Google Scholar
  12. [12]
    Leslie Lamport. The Temporal Logic of Actions. ACM Transactions on Programming Languages and Systems, 16(3):872–923, May 1994.CrossRefGoogle Scholar
  13. [13]
    Leslie Lamport. Refinement in state-based formalisms. Technical Note 1996-001, Digital Equipment Corporation, Systems Research Center, Palo Alto, California, December 1996.Google Scholar
  14. [14]
    Stephan Merz. A more complete TLA. Technical Report, Institut für Informatik, Universität München. Available on the WWW at URL http://www.pst.informatik.uni-muenchen.de/~merz/papers/gtla.html, 1999.
  15. [15]
    Stephan Merz. Isabelle/TLA. Available on the WWW at URL http://www.pst.informatik.uni-muenchen. de/~merz/isabelle/, 1997. Revised 1999.
  16. [16]
    Abdelillah Mokkedem and Dominique Méry. A stuttering closed temporal logic for modular reasoning about concurrent programs. In Temporal Logic (ICTL’ 94), volume 827 of Lecture Notes in Computer Science, pages 382–397, Bonn, 1994. Springer-Verlag.CrossRefGoogle Scholar
  17. [17]
    Amir Pnueli. System specification and refinement in temporal logic. In R.K. Shyamasundar, editor, Foundations of Software Technology and Theoretical Computer Science, volume 652 of Lecture Notes in Computer Science, pages 1–38. Springer-Verlag, 1992.Google Scholar
  18. [18]
    Alexander Rabinovich. Expressive completeness of temporal logic of action. In L. Brim, J. Gruska, and J. Zlatuska, editors, Mathematical Foundations of Computer Science, volume 1450 of Lecture Notes in Computer Science, Brno, Czech Republic, August 1998. Springer-Verlag.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Stephan Merz
    • 1
  1. 1.Institut für InformatikUniversität MünchenGermany

Personalised recommendations