Jump to content

Talk:Computation tree logic

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Ripper234 (talk | contribs) at 17:05, 2 April 2006 (move to CTL & state/path operators). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Names?

  • Does anybody know the full name for CTL*?
  • And by the way, I'm not sure if the correct name is "Computational tree logic" or "Computation tree logic". I've seen both. Which is the (more) correct one?

--[[User:Gedeon|Ged (talk)]] 18:45, 20 Jul 2004 (UTC)

State & path operators

I just came up with the terms "state operators" and "path operators" myself. If there is another "official" name for those or someone find something better, please edit... --[[User:Gedeon|Ged (talk)]] 02:00, 21 Jul 2004 (UTC)

move to CTL & state/path operators

Move

It's easier to explain what CTL* is and then say CTL is the subset where every temporal operator must be preceeded by a path quantifier.

  • Should there be only one page describing CTL, LTL, CTL* (unsure about the name though)?
  • Should the article on CTL* parctically duplicate the definitions used here? (My answer: NO)

state/path operators

There are no state/path operators. There are temporal operators, temporal quantifiers (could be considered as operators also, I don't know), and state and path formulas. I corrected it in the article.