Computation Tree Logic

- Natural & Formal Sciences -
Mathematics & Logic Dictionary
A branching-time temporal logic that combines temporal operators with explicit path quantifiers (A for 'for all paths', E for 'there exists a path') to state properties about trees of possible futures rather than single timelines.