World Library  
Flag as Inappropriate
Email this Article

Temporal logic

Article Id: WHEBN0000321481
Reproduction Date:

Title: Temporal logic  
Author: World Heritage Encyclopedia
Language: English
Subject: Modal logic, Early Islamic philosophy, History of logic, Logic, Linear temporal logic
Collection: Temporal Logic
Publisher: World Heritage Encyclopedia

Temporal logic

In logic, temporal logic is any system of rules and symbolism for representing, and reasoning about, propositions qualified in terms of time. In a temporal logic we can then express statements like "I am always hungry", "I will eventually be hungry", or "I will be hungry until I eat something". Temporal logic is sometimes also used to refer to tense logic, a particular modal logic-based system of temporal logic introduced by Arthur Prior in the late 1950s, and important results were obtained by Hans Kamp. Subsequently it has been developed further by computer scientists, notably Amir Pnueli, and logicians.

Temporal logic has found an important application in formal verification, where it is used to state requirements of hardware or software systems. For instance, one may wish to say that whenever a request is made, access to a resource is eventually granted, but it is never granted to two requestors simultaneously. Such a statement can conveniently be expressed in a temporal logic.


  • Motivation 1
  • History 2
  • Temporal operators 3
  • Temporal logics 4
  • See also 5
  • Notes 6
  • References 7
  • Further reading 8
  • External links 9


Consider the statement: "I am hungry." Though its meaning is constant in time, the truth value of the statement can vary in time. Sometimes the statement is true, and sometimes the statement is false, but the statement is never true and false simultaneously. In a temporal logic, statements can have a truth value which can vary in time. Contrast this with an atemporal logic, which can only discuss statements whose truth value is constant in time. This treatment of truth values over time differentiates temporal logic from computational verb logic.

Temporal logic always has the ability to reason about a time line. So-called linear time logics are restricted to this type of reasoning. Branching logics, however, can reason about multiple time lines. This presupposes an environment that may act unpredictably. To continue the example, in a branching logic we may state that "there is a possibility that I will stay hungry forever." We may also state that "there is a possibility that eventually I am no longer hungry." If we do not know whether or not I will ever get fed, these statements are both true some times.


Although Aristotle's logic is almost entirely concerned with the theory of the categorical syllogism, there are passages in his work that are now seen as anticipations of temporal logic, and may imply an early, partially developed form of first-order temporal modal binary logic. Aristotle was particularly concerned with the problem of future contingents, where he could not accept that the principle of bivalence applies to statements about future events, i.e. that we can presently decide if a statement about a future event is true or false, such as "there will be a sea battle tomorrow".[1]

There was little development for millennia, Charles Sanders Peirce noted in the 19th century:[2]

Arthur Prior was concerned with the philosophical matters of free will and predestination. According to his wife, he first considered formalizing temporal logic in 1953. He gave lectures on the topic at the University of Oxford in 1955-6, and in 1957 published a book, Time and Modality, in which he introduced a propositional modal logic with two temporal connectives (modal operators), F and P, corresponding to "sometime in the future" and "sometime in the past". In this early work, Prior considered time to be linear. In 1958 however, he received a letter from Saul Kripke, who pointed out that this assumption is perhaps unwarranted. In a development that foreshadowed a similar one in computer science, Prior took this under advisement, and developed two theories of branching time, which he called "Ockhamist" and "Peircean".[2] Between 1958 and 1965 Prior also corresponded with Charles Leonard Hamblin, and a number of early developments in the field can be traced to this correspondence, for example Hamblin implications. Prior published his most mature work on the topic, the book Past, Present, and Future in 1967. He died two years later.[3]

The binary temporal operators Since and Until were introduced by Hans Kamp in his 1968 Ph. D. thesis,[4] which also contains an important result relating temporal logic to first order logic—a result now known as Kamp's theorem.[5][2][6]

Two early contenders in formal verifications were Linear Temporal Logic (a linear time logic by Amir Pnueli) and Computation Tree Logic, a branching time logic by Mordechai Ben-Ari, Zohar Manna and Amir Pnueli. An almost equivalent formalism to CTL was suggested around the same time by E.M. Clarke and E.A. Emerson. The fact that the second logic can be decided more efficiently than the first does not reflect on branching and linear logics in general, as has sometimes been argued. Rather, Emerson and Lei show that any linear logic can be extended to a branching logic that can be decided with the same complexity.

Temporal operators

Temporal logic has two kinds of operators: logical operators and modal operators [1]. Logical operators are usual truth-functional operators (\neg,\or,\and,\rightarrow). The modal operators used in Linear Temporal Logic and Computation Tree Logic are defined as follows.

Textual Symbolic Definition Explanation Diagram
Binary operators
\phi U \psi \phi ~\mathcal{U}~ \psi \begin{matrix}(B\,\mathcal{U}\,C)(\phi)= \\ (\exists i:C(\phi_i)\land(\forall j Until: \psi holds at the current or a future position, and \phi has to hold until that position. At that position \phi does not have to hold any more.
\phi R \psi \phi ~\mathcal{R}~ \psi \begin{matrix}(B\,\mathcal{R}\,C)(\phi)= \\ (\forall i:C(\phi_i)\lor(\exists j Release: \phi releases \psi if \psi is true until the first position in which \phi is true (or forever if such a position does not exist).
Unary operators
N \phi \bigcirc \phi \mathcal{N}B(\phi_i)=B(\phi_{i+1}) Next: \phi has to hold at the next state. (X is used synonymously.)
F \phi \Diamond \phi \mathcal{F}B(\phi)=(true\,\mathcal{U}\,B)(\phi) Future: \phi eventually has to hold (somewhere on the subsequent path).
G \phi \Box \phi \mathcal{G}B(\phi)=\neg\mathcal{F}\neg B(\phi) Globally: \phi has to hold on the entire subsequent path.
A \phi \forall \phi \begin{matrix}(\mathcal{A}B)(\psi)= \\ (\forall \phi:\phi_0=\psi\to B(\phi))\end{matrix} All: \phi has to hold on all paths starting from the current state.
E \phi \exists \phi \begin{matrix}(\mathcal{E}B)(\psi)= \\ (\exists \phi:\phi_0=\psi\land B(\phi))\end{matrix} Exists: there exists at least one path starting from the current state where \phi holds.

Alternate symbols:

  • operator R is sometimes denoted by V
  • The operator W is the weak until operator: f W g is equivalent to f U g \or G f

Unary operators are well-formed formulas whenever B(\phi) is well-formed. Binary operators are well-formed formulas whenever B(\phi) and C(\phi) are well-formed.

In some logics, some operators cannot be expressed. For example, N operator cannot be expressed in Temporal Logic of Actions.

Temporal logics

Temporal logics include

A variation, closely related to Temporal or Chronological or Tense logics, are Modal logics based upon "topology", "place", or "spatial position".[8][9]

See also


  1. ^ Vardi 2008, p. 153
  2. ^ a b c Vardi 2008, p. 154
  3. ^ Peter Øhrstrøm; Per F. V. Hasle (1995). Temporal logic: from ancient ideas to artificial intelligence. Springer.   pp. 176-178, 210
  4. ^ "Temporal Logic (Stanford Encyclopedia of Philosophy)". Retrieved 2014-07-30. 
  5. ^ Walter Carnielli; Claudio Pizzi (2008). Modalities and Multimodalities. Springer. p. 181.  
  6. ^ Sergio Tessaris; Enrico Franconi; Thomas Eiter (2009). Reasoning Web. Semantic Technologies for Information Systems: 5th International Summer School 2009, Brixen-Bressanone, Italy, August 30 - September 4, 2009, Tutorial Lectures. Springer. p. 112.  
  7. ^ a b O. Maler, D. Nickovic, "Monitoring temporal properties of continuous signals", 2004
  8. ^ Nicholas Rescher, James Garson, "Topological Logic" in The Journal of Symbolic Logic, 33(4):537-548, December, 1968
  9. ^ Georg Henrik von Wright, "A Modal Logic of Place", in E. Sosa (Editor), pp. 65-73, "The Philosophy of Nicholas Rescher: Discussion and Replies", D. Reidel, Dordrecht, Holland, 1979


  • Mordechai Ben-Ari, Zohar Manna, Amir Pnueli: The Temporal Logic of Branching Time. POPL 1981: 164-176
  • Amir Pnueli: The Temporal Logic of Programs FOCS 1977: 46-57
  • Venema, Yde, 2001, "Temporal Logic," in Goble, Lou, ed., The Blackwell Guide to Philosophical Logic. Blackwell.
  • E. A. Emerson and C. Lei, modalities for model checking: branching time logic strikes back, in Science of Computer Programming 8, p 275-306, 1987.
  • E.A. Emerson, Temporal and modal logic, Handbook of Theoretical Computer Science, Chapter 16, the MIT Press, 1990
  • Moshe Y. Vardi (2008). "From   preprint Historical perspective on how seemingly disparate ideas came together in computer science and engineering. (The mention of Church in the title of this paper is a reference to a little-known 1957 paper, in which Church proposed a way to perform hardware verification.)

Further reading

  • Peter Øhrstrøm; Per F. V. Hasle (1995). Temporal logic: from ancient ideas to artificial intelligence. Springer.  

External links

  • Stanford Encyclopedia of Philosophy: "Temporal Logic" -- by Anthony Galton.
  • Temporal Logic by Yde Venema, formal description of syntax and semantics, questions of axiomatization. Treating also Kamp's dyadic temporal operators (since, until)
  • Notes on games in temporal logic by Ian Hodkinson, including a formal description of first-order temporal logic
  • CADP - provides generic model checkers for various temporal logic
  • PAT is a powerful free model checker, LTL checker, simulator and refinement checker for CSP and its extensions (with shared variable, arrays, wide range of fairness).
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.

Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.