Logic, Formal Verification, Machine Learning, AI.
\rightarrow can be expressed using \land, \neg. Path $\sigma$ is a sequence of states sampled from the transition graph. Given a system constraint expressed using LTL formula $\phi$, if path $\sigma$ does not violate the constraint, we say that: Two important general temporal operators: Diamond and