In logic, temporal logic is any system of rules and symbolism for representing, and reasoning about, propositions qualified in terms of time (for example, "I am always hungry", "I will eventually be hungry", or "I will be hungry until I eat something"). It is sometimes also used to refer to tense logic, a modal logic-based system of temporal logic introduced by Arthur Prior in the late 1950s, with important contributions by Hans Kamp. It has been further developed 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 [ edit ]
Consider the statement "I am hungry". Though its meaning is constant in time, the statement's truth value can vary in time. Sometimes it is true, and sometimes false, but never simultaneously true and false. In a temporal logic, a statement can have a truth value that varies in time—in contrast with an atemporal logic, which applies only to statements whose truth values are constant in time. This treatment of truth value over time differentiates temporal logic from computational verb logic.
Temporal logic always has the ability to reason about a timeline. So-called linear "time logics" are restricted to this type of reasoning. Branching logics, however, can reason about multiple timelines. 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", and that "there is a possibility that eventually I am no longer hungry". If we do not know whether or not I will ever be fed, these statements can both be true.
History [ edit ]
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".
|“||Time has usually been considered by logicians to be what is called 'extralogical' matter. I have never shared this opinion. But I have thought that logic had not yet reached the state of development at which the introduction of temporal modifications of its forms would not result in great confusion; and I am much of that way of thinking yet.||”|
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".[clarification needed] 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.
The binary temporal operators Since and Until were introduced by Hans Kamp in his 1968 Ph.D. thesis, which also contains an important result relating temporal logic to first-order logic—a result now known as Kamp's theorem.
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.
Prior's tense logic (TL) [ edit ]
- P: "It was the case that..." (P stands for "past")
- F: "It will be the case that..." (F stands for "future")
- G: "It always will be the case that..."
- H: "It always was the case that..."
These can be combined if we let π be an infinite path:
- : "At a certain point, is true at all future states of the path"
- : " is true at infinitely many states on the path"
From P and F one can define G and H, and vice versa:
Syntax and semantics [ edit ]
A minimal syntax for TL is specified with the following BNF grammar:
Kripke models are used to evaluate the truth of sentences in TL. A pair (T, <) of a set T and a binary relation < on T (called "precedence") is called a frame. A model is given by triple (T, <, V) of a frame and a function V called a valuation that assigns to each pair (a, u) of an atomic formula and a time value some truth value. The notion "ϕ is true in a model U=(T, <, V) at time u" is abbreviated U⊨ϕ[u]. With this notation,
|Statement||... is true just when|
|U⊨(ϕ∧ψ)[u]||U⊨ϕ[u] and U⊨ψ[u]|
|U⊨(ϕ∨ψ)[u]||U⊨ϕ[u] or U⊨ψ[u]|
|U⊨(ϕ→ψ)[u]||U⊨ψ[u] if U⊨ϕ[u]|
|U⊨Gϕ[u]||U⊨ϕ[v] for all v with u<v|
|U⊨Hϕ[u]||U⊨ϕ[v] for all v with v<u|
Given a class F of frames, a sentence ϕ of TL is
- valid with respect to F if for every model U=(T,<,V) with (T,<) in F and for every u in T, U⊨ϕ[u]
- satisfiable with respect to F if there is a model U=(T,<,V) with (T,<) in F such that for some u in T, U⊨ϕ[u]
- a consequence of a sentence ψ with respect to F if for every model U=(T,<,V) with (T,<) in F and for every u in T, if U⊨ψ[u], then U⊨ϕ[u]
Many sentences are only valid for a limited class of frames. It is common to restrict the class of frames to those with a relation < that is transitive, antisymmetric, reflexive, trichotomic, irreflexive, total, dense, or some combination of these.
A minimal axiomatic logic [ edit ]
Burgess outlines a logic that makes no assumptions on the relation <, but allows for meaningful deductions, based on the following axiom schema:
with the following rules of deduction:
- given A→B and A, deduce B (modus ponens)
- given a tautology A, infer GA
- given a tautology A, infer HA
One can derive the following rules:
- Becker's rule: given A→B, deduce TA→TB where T is a tense, any sequence made of G, H, F, and P.
- Mirroring: given a theorem A, deduce its mirror statementA§, which is obtained by replacing G by H (and so F by P) and vice versa.
- Duality: given a theorem A, deduce its dual statementA*, which is obtained by interchanging ∧ with ∨, G with F, and H with P.
Translation to predicate logic [ edit ]
Burgess gives a Meredith translation from statements in TL into statements in first-order logic with one free variable x0 (representing the present moment). This translation M is defined recursively as follows:
where is the sentence with all variable indices incremented by 1 and is a one-place predicate defined by .
Temporal operators [ edit ]
Temporal logic has two kinds of operators: logical operators and modal operators . Logical operators are usual truth-functional operators (). The modal operators used in linear temporal logic and computation tree logic are defined as follows.
|U||Until: holds at the current or a future position, and has to hold until that position. At that position does not have to hold any more.||
|R||Release: releases if is true up until and including the first position in which is true (or forever if such a position does not exist).||
|N||Next: has to hold at the next state. (X is used synonymously.)||
|F||Future: eventually has to hold (somewhere on the subsequent path).||
|G||Globally: has to hold on the entire subsequent path.||
|A||All: has to hold on all paths starting from the current state.|
|E||Exists: there exists at least one path starting from the current state where holds.|
- operator R is sometimes denoted by V
- The operator W is the weak until operator: is equivalent to
Unary operators are well-formed formulas whenever B() is well-formed. Binary operators are well-formed formulas whenever B() and C() 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 [ edit ]
Temporal logics include
- Interval temporal logic (ITL)
- Linear temporal logic (LTL)
- Computation tree logic (CTL)
- Signal temporal logic (STL)
- Timestamp temporal logic (TTL)
- Property specification language (PSL)
- CTL* which generalizes LTL and CTL
- Hennessy–Milner logic (HML)
- Modal μ-calculus which includes as a subset HML and CTL*
- Metric temporal logic (MTL)
- Metric interval temporal logic (MITL)
- Timed propositional temporal logic (TPTL)
- Truncated Linear Temporal Logic (TLTL)
See also [ edit ]
- HPO formalism
- Kripke structure
- Automata theory
- Chomsky grammar
- State transition system
- Duration calculus (DC)
- Hybrid logic
- Temporal logic in finite-state verification
- Temporal logic of actions (TLA)
- Important publications in formal verification (including the use of temporal logic in formal verification)
- Reo Coordination Language
- Modal logic
- Research Materials: Max Planck Society Archive
Notes [ edit ]
- Vardi 2008, p. 153
- Vardi 2008, p. 154
- Peter Øhrstrøm; Per F. V. Hasle (1995). Temporal logic: from ancient ideas to artificial intelligence. Springer. ISBN 978-0-7923-3586-3. pp. 176–178, 210
- "Temporal Logic (Stanford Encyclopedia of Philosophy)". Plato.stanford.edu. Retrieved 2014-07-30.
- Walter Carnielli; Claudio Pizzi (2008). Modalities and Multimodalities. Springer. p. 181. ISBN 978-1-4020-8589-5.
- 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. ISBN 978-3-642-03753-5.
- Prior, Arthur Norman (2003). Time and modality: the John Locke lectures for 1955–6, delivered at the University of Oxford. Oxford: The Clarendon Press. ISBN 9780198241584. OCLC 905630146.
- Lawford, M. (2004). "An Introduction to Temporal Logics" (PDF). Department of Computer Science McMaster University.
- Goranko, Valentin; Galton, Antony (2015). Zalta, Edward N. (ed.). The Stanford Encyclopedia of Philosophy (Winter 2015 ed.). Metaphysics Research Lab, Stanford University.
- Müller, Thomas (2011). "Tense or temporal logic" (PDF). In Horsten, Leon (ed.). The continuum companion to philosophical logic. A&C Black. p. 329.
- Burgess, John P. (2009). Philosophical logic. Princeton, New Jersey: Princeton University Press. p. 21. ISBN 9781400830497. OCLC 777375659.
- Burgess, John P. (2009). Philosophical logic. Princeton, New Jersey: Princeton University Press. p. 17. ISBN 9781400830497. OCLC 777375659.
- Maler, O.; Nickovic, D. (2004). "Monitoring temporal properties of continuous signals". doi:10.1007/978-3-540-30206-3_12.
- Koymans, R. (1990). "Specifying real-time properties with metric temporal logic", Real-Time Systems 2(4): 255–299. doi:10.1007/BF01995674.
- Li, Xiao, Cristian-Ioan Vasile, and Calin Belta. "Reinforcement learning with temporal logic rewards." doi:10.1109/IROS.2017.8206234
- Rescher, Nicholas (1968). "Topological Logic". Topics in Philosophical Logic. pp. 229–249. doi:10.1007/978-94-017-3546-9_13. ISBN 978-90-481-8331-9.
- von Wright, Georg Henrik (1979). "A Modal Logic of Place". The Philosophy of Nicholas Rescher. pp. 65–73. doi:10.1007/978-94-009-9407-2_9. ISBN 978-94-009-9409-6.
References [ edit ]
- 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, pp. 275–306, 1987.
- E. A. Emerson, "Temporal and modal logic", Handbook of Theoretical Computer Science, Chapter 16, the MIT Press, 1990
- A Practical Introduction to PSL, Cindy Eisner, Dana Fisman
- Vardi, Moshe Y. (2008). "From Church and Prior to PSL". In Orna Grumberg; Helmut Veith (eds.). 25 years of model checking: history, achievements, perspectives. Springer. ISBN 978-3-540-69849-4.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 [ edit ]
- Peter Øhrstrøm; Per F. V. Hasle (1995). Temporal logic: from ancient ideas to artificial intelligence. Springer. ISBN 978-0-7923-3586-3.
[ edit ]
|Wikimedia Commons has media related to Temporal logic.|
- 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).