LTL
E824076
LTL (Linear Temporal Logic) is a formalism used in computer science and logic to specify and reason about the temporal ordering of events along linear time, particularly in the verification of reactive and concurrent systems.
All labels observed (1)
| Label | Occurrences |
|---|---|
| LTL canonical | 3 |
How this entity was disambiguated
This entity first appeared as the object of triple T9838495 — 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: LTL Context triple: [Symbolic Model Checking, supportsLogic, LTL]
-
A.
LTL
LTL is the former official currency code for the Lithuanian litas, which was replaced by the euro in 2015.
-
B.
LTL
LTL is the National Rail station code for Littleborough railway station in Greater Manchester, England.
-
C.
TLT
TLT is the time zone abbreviation used for Timor Leste Time, the standard time observed in East Timor.
-
D.
TLA
TLA is a formal specification language developed by Leslie Lamport for describing and reasoning about concurrent and distributed systems using temporal logic.
-
E.
Lt
Lt is the standard military abbreviation for the commissioned officer rank of Lieutenant in the Australian Army.
- 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: LTL Target entity description: LTL (Linear Temporal Logic) is a formalism used in computer science and logic to specify and reason about the temporal ordering of events along linear time, particularly in the verification of reactive and concurrent systems.
-
A.
LTL
LTL is the National Rail station code for Littleborough railway station in Greater Manchester, England.
-
B.
LTL
LTL is the former official currency code for the Lithuanian litas, which was replaced by the euro in 2015.
-
C.
TLT
TLT is the time zone abbreviation used for Timor Leste Time, the standard time observed in East Timor.
-
D.
TLA
TLA is a formal specification language developed by Leslie Lamport for describing and reasoning about concurrent and distributed systems using temporal logic.
-
E.
Lt
Lt is the standard military abbreviation for the commissioned officer rank of Lieutenant in the Australian Army.
- F. None of above. chosen
Statements (52)
| Predicate | Object |
|---|---|
| instanceOf |
formal specification language
ⓘ
modal logic ⓘ temporal logic ⓘ |
| basedOn | linear time semantics ⓘ |
| comparedTo | branching temporal logics such as CTL ⓘ |
| extends | propositional logic ⓘ |
| field |
computer science
ⓘ
formal methods ⓘ mathematical logic ⓘ |
| fullName | Linear Temporal Logic NERFINISHED ⓘ |
| hasAutomataTheoreticCorrespondence |
Büchi automata
NERFINISHED
ⓘ
ω-automata ⓘ |
| hasDecisionProblem |
model checking
ⓘ
satisfiability ⓘ |
| hasOperator |
F (eventually)
ⓘ
G (globally) ⓘ R (release) ⓘ U (until) ⓘ X (next) ⓘ |
| hasSemanticDomain |
infinite sequences of states
ⓘ
paths in transition systems ⓘ |
| hasSemantics | defined via satisfaction over paths ⓘ |
| hasSyntax | formulas built from atomic propositions and temporal operators ⓘ |
| hasVariant |
LTL with past operators
ⓘ
metric temporal logic (MTL) ⓘ probabilistic LTL ⓘ |
| importantIn |
concurrent and distributed systems
ⓘ
hardware verification ⓘ reactive system design ⓘ software verification ⓘ |
| introducedBy | Amir Pnueli NERFINISHED ⓘ |
| introducedIn | 1977 ⓘ |
| introducedInWork | "The Temporal Logic of Programs" NERFINISHED ⓘ |
| modelCheckingComplexity |
PSPACE-complete in formula size
ⓘ
linear in model size ⓘ |
| recognizedBy | Turing Award citation of Amir Pnueli ⓘ |
| satisfiabilityComplexity | PSPACE-complete ⓘ |
| supportsPropertyType |
fairness properties
ⓘ
liveness properties ⓘ safety properties ⓘ |
| usedFor |
model checking
ⓘ
program specification ⓘ protocol specification ⓘ runtime verification ⓘ specifying temporal properties of systems ⓘ verification of concurrent systems ⓘ verification of reactive systems ⓘ |
| usedInStandard |
PSL (Property Specification Language)
NERFINISHED
ⓘ
SVA (SystemVerilog Assertions) NERFINISHED ⓘ |
| usedInTool |
NuSMV
NERFINISHED
ⓘ
PRISM NERFINISHED ⓘ SPIN model checker NERFINISHED ⓘ |
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: LTL Description of subject: LTL (Linear Temporal Logic) is a formalism used in computer science and logic to specify and reason about the temporal ordering of events along linear time, particularly in the verification of reactive and concurrent systems.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject surface form:
Model Checking