| Computational Tree Logic |
Article Index for Computational |
Website Links For Computational |
Information AboutComputational Tree Logic |
| CATEGORIES ABOUT COMPUTATIONAL TREE LOGIC | |
| logic in computer science | |
| modal logic | |
|
Computational 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 of which might be 'actual' path that is realised.
The Language of Well-Formed CTL Formulae is generated by the following unambiguous (wrt bracketing) Context-Free Grammar : | ||
| A | "\phi" class="copylinks" target="_blank">U \phi E U \phi </math> |
|
|