Here you can ask questions and find or give answers to organizational, academic and other questions about studying computer science.
1.1k questions
1.3k answers
1.7k comments
556 users
EFa ∧ EFb is a CTL formula, but it is not equivalent to E(Fa ∧ Fb): The latter asks for one path where at some point a and at some point b holds, while the former would allow that Fa is satisfied on one path p1 while Fb is satisfied on another path p2 and none of the paths p1 and p2 would satisfy the other formula.