- Applied mathematics
- >
- Mathematical modeling
- >
- Formal specification languages
- >
- Temporal logic

- Applied mathematics
- >
- Theoretical computer science
- >
- Logic in computer science
- >
- Temporal logic

- Fields of mathematics
- >
- Mathematical logic
- >
- Logic in computer science
- >
- Temporal logic

- Fields of mathematics
- >
- Mathematical logic
- >
- Modal logic
- >
- Temporal logic

- Formal methods
- >
- Formal specification
- >
- Formal specification languages
- >
- Temporal logic

- Mathematical logic
- >
- Logic in computer science
- >
- Modal logic
- >
- Temporal logic

- Mathematical logic
- >
- Non-classical logic
- >
- Modal logic
- >
- Temporal logic

- Mathematics of computing
- >
- Formal methods
- >
- Model checking
- >
- Temporal logic

- Mathematics of computing
- >
- Logic in computer science
- >
- Modal logic
- >
- Temporal logic

- Model theory
- >
- Finite model theory
- >
- Model checking
- >
- Temporal logic

- Philosophy of mathematics
- >
- Mathematical logic
- >
- Logic in computer science
- >
- Temporal logic

- Philosophy of mathematics
- >
- Mathematical logic
- >
- Modal logic
- >
- Temporal logic

- Theoretical computer science
- >
- Formal methods
- >
- Model checking
- >
- Temporal logic

- Theoretical computer science
- >
- Logic in computer science
- >
- Modal logic
- >
- Temporal logic

- Theoretical computer science
- >
- Mathematics of computing
- >
- Logic in computer science
- >
- Temporal logic

CTL*

CTL* is a superset of computational tree logic (CTL) and linear temporal logic (LTL). It freely combines path quantifiers and temporal operators. Like CTL, CTL* is a branching-time logic. The formal s

Temporal logic of actions

Temporal logic of actions (TLA) is a logic developed by Leslie Lamport, which combines temporal logic with a .It is used to describe behaviours of concurrent and distributed systems. It is the logic u

Linear-time temporal logic

No description available.

Linear temporal logic

In logic, linear temporal logic or linear-time temporal logic (LTL) is a modal temporal logic with modalities referring to time. In LTL, one can encode formulae about the future of paths, e.g., a cond

Metric temporal logic

Metric temporal logic (MTL) is a special case of temporal logic. It is an extension of temporal logic in which temporal operators are replaced by time-constrained versions like until, next, since and

Temporal logic

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 h

Fair computational tree logic

Fair computational tree logic is conventional computational tree logic studied with explicit fairness constraints.

Linear temporal logic to Büchi automaton

In formal verification,finite state model checking needs to find a Büchi automaton (BA) equivalent to a given linear temporal logic (LTL) formula, i.e., such that the LTL formula and the BA recognize

Probabilistic CTL

Probabilistic Computation Tree Logic (PCTL) is an extension of computation tree logic (CTL) that allows for probabilistic quantification of described properties. It has been defined in the paper by Ha

Interval temporal logic

Interval temporal logic (also interval logic) is a temporal logic for representing both propositional and first-order logical reasoning about periods of time that is capable of handling both sequentia

Computation tree logic

Computation tree logic (CTL) is a branching-time logic, meaning that its model of time is a tree-like structure in which the future is not determined; there are different paths in the future, any one

Duration calculus

Duration calculus (DC) is an interval logic for real-time systems. It was originally developed by Zhou Chaochen with the help of Anders P. Ravn and C. A. R. Hoare on the European ESPRIT Basic Research

Timed propositional temporal logic

In model checking, a field of computer science, Timed Propositional Temporal Logic (TPTL) is an extension of Linear Temporal Logic (LTL) in which variables are introduced to measure times between two

Kripke structure (model checking)

A Kripke structure is a variation of the transition system, originally proposed by Saul Kripke, used in model checking to represent the behavior of a system.It consists of a graph whose nodes represen

© 2023 Useful Links.