Relations With Other Logics
Computation tree logic (CTL) is a subset of CTL* as well as of the modal µ calculus. CTL is also a fragment of Alur, Henzinger and Kupferman's Alternating-time Temporal Logic (ATL).
Computation tree logic (CTL) and Linear temporal logic (LTL) are both a subset of CTL*. CTL and LTL are not equivalent and they have a common subset, which is a proper subset of both CTL and LTL.
- FG.P exists in LTL but not in CTL.
- AG(P((EX.Q)(EX¬Q))) exists in CTL but not in LTL.
Read more about this topic: Computation Tree Logic
Famous quotes containing the words relations and/or logics:
“In today’s world parents find themselves at the mercy of a society which imposes pressures and priorities that allow neither time nor place for meaningful activities and relations between children and adults, which downgrade the role of parents and the functions of parenthood, and which prevent the parent from doing things he wants to do as a guide, friend, and companion to his children.”
—Urie Bronfenbrenner (b. 1917)
“When logics die,
The secret of the soil grows through the eye,
And blood jumps in the sun;
Above the waste allotments the dawn halts.”
—Dylan Thomas (1914–1953)