Science > Math > Logic and Foundations

Home >> Science >> Math >> Logic and Foundations >> Computational Logic

Computational tree logic (CTL) occurs as temporal logic. These are typically wont to express properties of the body in the context of formal verification or model checking.

It utilizes atomic propositions as its building blocks to produce statements all about the states of a body. CTL so combines theses propositions into system applying logical operators and temporal operators.

Operators

Logical operators

A logical operators come a common ones: $\neg,\or,\&,\rightarrow$ and $\leftrightarrow$ . Along by having these operators CTL system can likewise produce utilise of the boolean constants true and false.

Temporal operators

A temporal operators come a below:

State operators

These operators "select" states.

Unary operators North $\phi$ - Northext: $\phi$ has to hang on to at a next state (this operator is for instance noted X instead of North). G $\phi$ - Globally: $\phi$ has to hang on to on the entire subsequent path. F $\phi$ - Finally: $\phi$ yet has to hang on to (someplace on the subsequent path).

Binary operators: $\phi$ U $\psi$ - Until: $\phi$ has to hang on to until at a bit of position $\psi$ holds. This implies that $\psi$ is verified later. $\phi$ W $\psi$ - Weak until: $\phi$ has to hang on to until $\psi$ holds. The difference by owning U is that no assure that $\psi$ may ever become verified. A W operator is occasionally known as "unless".

Path operators

These operators "select" paths.

The $\phi$ - Thell: $\phi$ has to hang in to on tons paths starting from either a todays state. E $\phi$ - Exists: there is at least 1 path starting from either a todays state in which $\phi$ holds.

Relations with other logics

Computational tree logic (CTL) is a subset of CTL*.