(definition)
Definition: A propositional, branching-time temporal logic for which formulas can be checked in linear time. An acronym for Computation Tree Logic.
Note: CTL differs from CTL* in that in CTL path quantifiers (E and A) always appear with temporal operators (F, G, X, U, etc.). Therefore CTL formulas are state formulas.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 December 2004.
HTML page formatted Mon Sep 11 09:46:02 2006.
Cite this as:
Paul E. Black, "CTL", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/ctl.html