1994
DOI: 10.1145/177492.177726
|View full text |Cite
|
Sign up to set email alerts
|

The temporal logic of actions

Abstract: 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 practice. This … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
709
1
10

Year Published

1995
1995
2015
2015

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 1,287 publications
(721 citation statements)
references
References 17 publications
1
709
1
10
Order By: Relevance
“…Although I have carried out the verification using a simple version of the I/O automaton model, it is probably trivial to translate this story to other state based models, such as Lamport's Temporal Logic of Actions [8].…”
Section: Discussionmentioning
confidence: 99%
“…Although I have carried out the verification using a simple version of the I/O automaton model, it is probably trivial to translate this story to other state based models, such as Lamport's Temporal Logic of Actions [8].…”
Section: Discussionmentioning
confidence: 99%
“…This presupposes the adequacy of mathematical abstractions specifically invented or adopted and elaborated for the expression of more sophisticated modalities of time's now than those currently used in such formalisms as temporal logic (e.g. TLA, Lamport, 1994;. There is much to be explored in what other languages and cultures deliver to physics (e.g.…”
Section: Epiloguementioning
confidence: 99%
“…However, Lamport [10] has identified a shortcoming of standard linear-time temporal logic (LTL): because it is based on a global notion of "next state", it does not allow to relate specifications written at different levels of abstraction. He has therefore maintained that specifications should be invariant under "stuttering", that is, finite repetitions of identical states, and has proposed the Temporal Logic of Actions (TLA) [12,13,6]. Characteristically, TLA formulas contain the "next-time" operator only in a restricted form and can therefore not distinguish between stuttering-equivalent behaviors.…”
Section: Introductionmentioning
confidence: 99%