linear temporal logic
E467810
Linear temporal logic is a modal temporal logic used in computer science and formal methods to specify and reason about the behavior of systems over linear sequences of time, using operators that describe how properties evolve in the future.
All labels observed (2)
| Label | Occurrences |
|---|---|
| linear temporal logic canonical | 1 |
| linear-time temporal logic | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T4765320 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: linear temporal logic Context triple: [Temporal Logic of Actions, comparedWith, linear temporal logic]
-
A.
branching-time temporal logic CTL*
Branching-time temporal logic CTL* is a highly expressive formalism in computer science used to specify and reason about the behavior of concurrent and reactive systems over branching time structures.
-
B.
Temporal Logic of Actions
Temporal Logic of Actions is a formal framework for specifying and reasoning about concurrent and distributed systems using temporal logic to describe system behaviors over time.
-
C.
LTL
LTL is the National Rail station code for Littleborough railway station in Greater Manchester, England.
-
D.
LTL
LTL is the former official currency code for the Lithuanian litas, which was replaced by the euro in 2015.
-
E.
Temporal Verification of Reactive Systems
"Temporal Verification of Reactive Systems" is a foundational book in formal methods that presents rigorous techniques for specifying and verifying the correctness of reactive and concurrent systems using temporal logic.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: linear temporal logic Target entity description: Linear temporal logic is a modal temporal logic used in computer science and formal methods to specify and reason about the behavior of systems over linear sequences of time, using operators that describe how properties evolve in the future.
-
A.
branching-time temporal logic CTL*
Branching-time temporal logic CTL* is a highly expressive formalism in computer science used to specify and reason about the behavior of concurrent and reactive systems over branching time structures.
-
B.
Temporal Logic of Actions
Temporal Logic of Actions is a formal framework for specifying and reasoning about concurrent and distributed systems using temporal logic to describe system behaviors over time.
-
C.
LTL
LTL is the National Rail station code for Littleborough railway station in Greater Manchester, England.
-
D.
LTL
LTL is the former official currency code for the Lithuanian litas, which was replaced by the euro in 2015.
-
E.
Temporal Verification of Reactive Systems
"Temporal Verification of Reactive Systems" is a foundational book in formal methods that presents rigorous techniques for specifying and verifying the correctness of reactive and concurrent systems using temporal logic.
- F. None of above. chosen
Statements (92)
| Predicate | Object |
|---|---|
| instanceOf |
formal specification language
ⓘ
modal logic ⓘ propositional logic extension ⓘ temporal logic ⓘ |
| hasAbbreviation | LTL NERFINISHED ⓘ |
| hasApplication |
NuSMV model checker
NERFINISHED
ⓘ
PRISM model checker NERFINISHED ⓘ SPIN model checker NERFINISHED ⓘ UPPAAL via encodings ⓘ runtime monitoring tools ⓘ |
| hasDomain |
automata theory
ⓘ
computer science ⓘ concurrent systems ⓘ distributed systems ⓘ formal methods ⓘ model checking ⓘ program verification ⓘ reactive systems ⓘ |
| hasHistoricalOrigin |
introduced in temporal logic research of the 1970s
ⓘ
popularized in program verification in the 1980s ⓘ |
| hasKeyConcept |
linear time structure
ⓘ
paths as sequences of states ⓘ safety and liveness decomposition ⓘ temporal modalities ⓘ temporal operators over paths ⓘ |
| hasOperator |
F
ⓘ
G ⓘ R ⓘ U ⓘ W ⓘ X ⓘ |
| hasProperty |
PSPACE-complete model checking for explicit-state
ⓘ
PSPACE-complete satisfiability ⓘ PSPACE-complete validity ⓘ branching-free temporal logic ⓘ closed under boolean operations ⓘ decidable model checking ⓘ decidable satisfiability ⓘ equivalent in expressive power to ω-regular languages ⓘ expresses temporal properties of executions ⓘ future-time temporal logic ⓘ interpreted over linear time ⓘ path-based semantics ⓘ state-based semantics ⓘ supports compositional specification ⓘ supports eventualities ⓘ supports fairness properties ⓘ supports invariants ⓘ supports liveness properties ⓘ supports refinement reasoning ⓘ supports response properties ⓘ supports safety properties ⓘ supports temporal reasoning ⓘ |
| hasSemantics |
formulas evaluated over infinite sequences of states
ⓘ
models are infinite words over atomic propositions ⓘ satisfaction defined at positions in a path ⓘ |
| hasSyntaxElement |
boolean connectives
ⓘ
propositional variables ⓘ temporal operators ⓘ |
| hasTransformation |
translation to Büchi automata
ⓘ
translation to alternating automata ⓘ translation to generalized Büchi automata ⓘ |
| hasVariant |
LTL over finite traces
ⓘ
LTL with past operators NERFINISHED ⓘ LTLf NERFINISHED ⓘ branching-time temporal logics ⓘ metric temporal logic ⓘ past-time linear temporal logic ⓘ probabilistic linear temporal logic ⓘ |
| isRelatedTo |
Büchi automata
NERFINISHED
ⓘ
CTL* NERFINISHED ⓘ Computation Tree Logic NERFINISHED ⓘ dynamic logic ⓘ modal μ-calculus ⓘ regular expressions over infinite words ⓘ μ-calculus ⓘ ω-automata ⓘ |
| isUsedFor |
formal verification of safety-critical systems
ⓘ
runtime verification specifications ⓘ specifying communication protocols ⓘ specifying correctness properties of programs ⓘ specifying hardware circuits ⓘ specifying system requirements ⓘ specifying temporal constraints in planning ⓘ specifying temporal constraints in workflows ⓘ synthesis of reactive systems ⓘ |
| operatorName |
F is eventually
ⓘ
G is globally ⓘ R is release ⓘ U is until ⓘ W is weak until ⓘ X is next ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: linear temporal logic Description of subject: Linear temporal logic is a modal temporal logic used in computer science and formal methods to specify and reason about the behavior of systems over linear sequences of time, using operators that describe how properties evolve in the future.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
linear-time temporal logic