You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
2 lines
248 B
2 lines
248 B
\item \self Give an intuitive explanation of the semantics of computation tree logic $CTL^\star$.
|
|
Therefore, explain the semantics of the introduced path quantifiers and temporal operators with respect to the computation tree of a Kripke structure.
|