computation tree logic
Jump to navigation
Jump to search
English[edit]
Noun[edit]
computation tree logic (uncountable)
- (computer science) A particular modal logic of branching time with operators "next", "globally", "finally" or "eventually", "until", and "weak until".
Synonyms[edit]
- computational tree logic (less common)
- CTL