Questionnaire-2024/temporal_logic/0006.tex

\item \lect
Translate the following sentences in computation tree logic $CTL^\star$.
\begin{itemize}
    \item The robot can visit region A infinitely often and region C infinitely often
    \item Always, the robot visits region A infinitely often and region C infinitely often.
    \item If the robot visits region A infinitely often, it should also visit region C finitely often.
\end{itemize}