linear temporal logic

E467810

formal specification language modal logic propositional logic extension temporal logic

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.

Try in SPARQL Jump to: Surface forms Statements Referenced by

Observed surface forms (1)

Surface form	Occurrences
linear-time temporal logic	1

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 ⓘ

Referenced by (2)

Full triples — surface form annotated when it differs from this entity's canonical label.

Temporal Logic of Actions → comparedWith → linear temporal logic ⓘ

Amir Pnueli → notableConcept → linear temporal logic ⓘ

this entity surface form: linear-time temporal logic