computation tree logic

English

Noun

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
  • computational tree logic (less common)
  • CTL
This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.