computation tree logic

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English

[edit]

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]