"There are two types of formulas in CTL*: state formulas(which are true in a specific state) and path formulas (which are true along a specific path)"
"Computation Tree Logic (CTL) is a restricted subset of CTL* in which each of the temporal operators X, F, G, U and R must be immediately preceded by a path quantifier."
"Linear Temporal Logic(LTL),on the other hand, will consist of formulas that have the form A f where f is path formula in which the only state subformulas permitted are atomic propositions"
This is an excellent book for the introduction of model checking. From my view point, there is still a lot of space for improvement on teaching model checking. Model checking is a very simple problem on how to explore the huge space. This book tells the solutions, but does not tell how people find out these solutions.