User:PhS/CTL

From Wikipedia, the free encyclopedia

This is my draft for a CTL article -- PhS 21:58, 13 February 2006 (UTC)

CTL, the Computation tree logic, is a temporal logic used in computer science. It arose in the 1980s as a convenient formalism for stating and checking behavioral properties of systems and played in a key rôle in the early development of model checking. Nowadays, the widespread use of powerful symbolic CTL-based model checkers makes it one of the most famous temporal logics.

CTL can express statements about the correctness of a system's behavior, like for example "pressing a stop button is always eventually followed by the system shutting down but not before the engine halts". It is then possible to check automatically whether such statements are satisfied by a given actual system model, a procedure called model checking.

The popularity of CTL comes from the good compromise it offers between, on the one hand, its simplicity and expressive power, and on the other hand, the existence of simple and efficient model-checking methods for CTL statements.

1 CTL formulae and their meaning
2 Checking CTL formulae over systems
3 The expressive power of CTL
4 Extensions of CTL
5 Bibliography
6 Operators
- 6.1 Logical operators
- 6.2 Temporal operators
  - 6.2.1 State operators
  - 6.2.2 Path operators
7 Relations with other logics
8 See also
9 References

[edit] CTL formulae and their meaning

CTL views the behavior of a nondeterministic system as a set of runs, or computations, arranged in a branching tree of configurations. Times progresses when one moves along a run, from past configurations to future ones.

A picture illustrating a tree of configurations is needed here

[edit] Simple CTL modalities

A CTL formula states a property of some current configuration. This property can refer to properties at other configurations that may happen in the future.

For example, the formula $E F p$ states that there is a possible future configuration where $p$ holds. One can read it as " $p$ is possible", or " $p$ may happen the future".

The formula $A F p$ states that whatever path is followed, some configuration where $p$ holds will eventually be reached. It can be read as " $p$ is inevitable", or " $p$ will happen in the future".

In the above examples, $E F$ and $A F$ are modalities. They link "simpler" statements about other configurations in order to build a "more complex" statement about the current configuration. They also define how these configurations are linked. With $E F$ we require one configuration reachable from the current configuration, hence a configuration that may happen in the future. With $A F$ we also refer to one future configuration but we require at least one such configuration along every run that start from the current configuration. Hence we require a set of configurations that will inevitably be visited.

[edit] Other CTL modalities

Other modalities are $E G$ and $A G$ . $E G p$ states that there is a run along which $p$ is always verified. One can read it as "it is possible that $p$ always holds." $A G p$ states that all reachable configurations satisfy $p$ , hence $p$ will always hold whatever path is chosen. One can read it as " $p$ will always holds."

[edit] Combining modalities

[edit] Checking CTL formulae over systems

[edit] The expressive power of CTL

[edit] Extensions of CTL

[edit] Bibliography

rest of the article comes from the original one

[edit] Operators

[edit] Logical operators

The logical operators are the usual ones: $\neg,\or,\and,\rightarrow$ and $\leftrightarrow$ . Along with these operators CTL formulas can also make use of the boolean constants true and false.

[edit] Temporal operators

The temporal operators are the following:

[edit] State operators

These operators "select" states.

Unary operators

N $φ$ - Next: $φ$ has to hold at the next state (this operator is sometimes noted X instead of N).
G $φ$ - Globally: $φ$ has to hold on the entire subsequent path.
F $φ$ - Finally: $φ$ eventually has to hold (somewhere on the subsequent path).

Binary operators:

$φ$ U $ψ$ - Until: $φ$ has to hold until at some position $ψ$ holds. This implies that $ψ$ will be verified in the future.
$φ$ W $ψ$ - Weak until: $φ$ has to hold until $ψ$ holds. The difference with U is that there is no guarantee that $ψ$ will ever be verified. The W operator is sometimes called "unless".

[edit] Path operators

These operators "select" paths.

A $φ$ - All: $φ$ has to hold on all paths starting from the current state.
E $φ$ - Exists: there exists at least one path starting from the current state where $φ$ holds.

[edit] Relations with other logics

EME90 ^[1], MC ^[2], CTL vs. CTL+ ^[3], etc.

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

[edit] See also

Linear temporal logic

[edit] References

Emerson, E. A. and Halpern, J. Y. (1985). "Decision procedures and expressiveness in the temporal logic of branching time". Journal of Computer and System Sciences 30 (1): 1–24.
Clarke, E. M., Emerson, E. A., and Sistla, A. P. (1986). "Automatic verification of finite-state concurrent systems using temporal logic specifications". ACM Transactions on Programming Languages and Systems 8 (2): 244–263.
Emerson, E. A. (1990). "Temporal and modal logic", in J. van Leeuwen (ed.): Handbook of Theoretical Computer Science, vol. B. MIT Press, pp. 955–1072. ISBN 0262220393.

Retrieved from "http://en.wikipedia.org../../../p/h/s/User%7EPhS_CTL_ee38.html"