The temporal logic of actions

@article{Lamport1994TheTL,
  title={The temporal logic of actions},
  author={Leslie Lamport},
  journal={ACM Trans. Program. Lang. Syst.},
  year={1994},
  volume={16},
  pages={872-923}
}
  • L. Lamport
  • Published 1 May 1994
  • Computer Science, Philosophy
  • ACM Trans. Program. Lang. Syst.
The temporal logic of actions (TLA) is a logic for specifying and reasoning about concurrent systems. Systems and their properties are represented in the same logic, so the assertion that a system meets its specification and the assertion that one system implements another are both expressed by logical implication. TLA is very simple; its syntax and complete formal semantics are summarized in about a page. Yet, TLA is not just a logician's toy; it is extremely powerful, both in principle and in… 

Figures from this paper

Logic of involved variables - system specification with temporal logic of distributed actions
  • A. Alexander, W. Reisig
  • Computer Science, Philosophy
    Third International Conference on Application of Concurrency to System Design, 2003. Proceedings.
  • 2003
TLDR
A different semantical model based on partial order which evidently increases the expressiveness of the logic is proposed which can distinguish between concurrency and nondeterministic choice.
Composition of Temporal Logic Specifications
TLDR
This work proposes a different semantical model based on partial order which increases the expressiveness of the logic and can be syntactically viewed as an extension of TLA.
Specifying Concurrent Program Based on TLA
TLDR
This paper introduces the concurrent programming languages and behavior semantics, mainly describe safety properties and liveness properties in TLA and takes NeedhamSchroeder symmetric key protocol as an example to illustrate how to specify these properties in concurrent program by TLA.
Formal Reasoning about Actor Programs Using Temporal Logic
  • S. Schacht
  • Computer Science
    Concurrent Object-Oriented Programming and Petri Nets
  • 2001
TLDR
This work presents an approach to reasoning about actor programs on the basis of temporal logic and demonstrates it by applying it to a detection algorithm for termination of parts of a computation.
Combining a state based formalism with temporal logic
TLDR
A combination of a state-based formalism and a temporal logic is proposed to get an expressive language for various descriptions of reactive systems to use as a model as well as a property oriented specification style in one description.
Axiomatic Temporal Logic Programs Verification
  • Xiaoxiao Yang, Zhenhua Duan
  • Computer Science
    2010 4th IEEE International Symposium on Theoretical Aspects of Software Engineering
  • 2010
TLDR
A set of state axioms and state inference rules are given that enable us to deduce a program in its normal form at the current state to the next one and to verify safety, liveness properties over an interval.
Verification of Reactive Systems Using Temporal Logic with Clocks
An introduction to assertional reasoning for concurrent systems
TLDR
This is a tutorial introduction to assertional reasoning based on temporal logic using Hoare logic and a subset of linear-time temporal logic, specifically, invariant assertions and leads-to assertions.
A Logic to Specify and Verify Synchronous Transitions
TLDR
This paper introduces a formalism named SINC aimed at the design and verification of synchronous concurrent systems and discusses some of the pragmatics in specifying and verifying systems using SINC, and presents extensions to deal with generic parameters and regular structures.
A Formulation of TLA in Isabelle
TLDR
This paper presents a formulation of TLA in the Isabelle theorem prover, in which it is shown how the syntax for easy axiomatisation of logics and the existence of parsing and printing facilities have facilitated the embedding of different logics.
...
...

References

SHOWING 1-10 OF 87 REFERENCES
The temporal logic of programs
  • A. Pnueli
  • Computer Science
    18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
  • 1977
A unified approach to program verification is suggested, which applies to both sequential and parallel programs. The main proof method suggested is that of temporal reasoning in which the time
Mechanical Verification of Concurrent Systems with TLA
TLDR
An initial version of a system for mechanically checking the correctness proof of a concurrent system, using a mechanical verifier to check each step of the proof, translating the step's assertion into a theorem in the verifier's logic and its proof into instructions for the verifiers.
The Temporal Semantics of Concurrent Programs
  • A. Pnueli
  • Computer Science
    Theor. Comput. Sci.
  • 1981
Hybrid Systems in TLA+
TLDR
TLA+ is used to define operators for specifying the temporal behavior of physical components obeying integral equations of evolution, together with previously defined operators for describing timing constraints, are used to specify a toy gas burner introduced by Ravn, Rischel, and Hansen.
The Temporal Logic of Reactive and Concurrent Systems
TLDR
This volume offers an introduction to temporal logic and to the computational model for reactive programs which has been developed by the authors.
Specifying Concurrent Program Modules
A method for specifying program modules in a concurrent program is described. It is based upon temporal logic, but uses new kinds of temporal assertions to make the specifications simpler and easier
Hybrid Systems in Tla + Hybrid Systems in Tla +
TLDR
TLA + is used to deene operators for specifying the temporal behavior of physical components obeying integral equations of evolution and these operators are used to specify a toy gas burner introduced by Ravn, Rischel, and Hansen.
A simple approach to specifying concurrent systems
TLDR
The transition axiom method provides a conceptual and logical foundation for writing formal specifications; it is not a specification language and is not meant as a paradigm for how systems should be built.
"Sometime" is sometimes "not never": on the temporal logic of programs
  • L. Lamport
  • Philosophy, Computer Science
    POPL '80
  • 1980
TLDR
The logical foundations of the application of temporal logic to concurrent programs are clarified, and the relation between concurrency and nondeterminism is clarified, as well as some problems for further research.
An Axiomatization of Lamport's Temporal Logic of Actions
TLDR
A complete proof system for a propositional temporal logic of actions, PTLA, is presented and it seems worthwhile to search for axiomatizations of some of them as well.
...
...