computation tree logic

Definition from Wiktionary, the free dictionary
Jump to: navigation, search

English[edit]

Wikipedia has an article on:

Wikipedia

Noun[edit]

computation tree logic (uncountable)

  1. (computer science) A particular modal logic of branching time with operators "next", "globally", "finally" or "eventually", "until", and "weak until".

Synonyms[edit]