Statements (47)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:logic
|
| gptkbp:abbreviation |
LTL
|
| gptkbp:complexityOfSatisfiability |
PSPACE-complete
|
| gptkbp:distinctFrom |
gptkb:Computation_tree_logic
|
| gptkbp:field |
gptkb:logic
Computer science Formal verification |
| gptkbp:hasApplication |
gptkb:Automata_theory
Concurrent systems Hardware verification Reactive systems Software verification Specification languages |
| gptkbp:hasAutomataCorrespondence |
Büchi automata
ω-automata |
| gptkbp:hasProperty |
Linear time
No explicit quantification over paths Propositional base Temporal operators |
| gptkbp:hasSemantics |
Linear time semantics
|
| gptkbp:hasSubgroup |
gptkb:logic
|
| gptkbp:hasSyntax |
Propositional logic with temporal operators
|
| https://www.w3.org/2000/01/rdf-schema#label |
Linear temporal logic
|
| gptkbp:introduced |
gptkb:Amir_Pnueli
|
| gptkbp:introducedIn |
1977
|
| gptkbp:isDecidable |
True
|
| gptkbp:operator |
F (eventually)
G (globally) R (release) U (until) X (next) |
| gptkbp:publishedIn |
gptkb:The_Temporal_Logic_of_Programs_(Pnueli,_1977)
|
| gptkbp:relatedTo |
gptkb:logic
gptkb:Computation_tree_logic Modal logic |
| gptkbp:taughtAt |
Computer science curricula
Formal methods courses Logic in computer science courses |
| gptkbp:usedFor |
Model checking
Formal verification of hardware and software Specification of temporal properties |
| gptkbp:usedIn |
gptkb:NuSMV
gptkb:SPIN_model_checker Formal methods Model checking tools |
| gptkbp:bfsParent |
gptkb:logic
|
| gptkbp:bfsLayer |
4
|