par Massart, Thierry ;Meuter, Cédric ;Van Begin, Laurent
Référence Information processing letters, 106, 3, page (120-126)
Publication Publié, 2008-04
Article révisé par les pairs
Résumé : The theoretical complexity of CTL*, CTL and LTL model checking over finite partial order traces are studied. CTL* and CTL model checking are PSPACE-complete and that the LTL model checking is coNP-complete. Since CTL is a fragment of CTL*, it implies that the problem for CTL* is also PSPACE-hard. Then, it is showed that, for CTL*, the problem is in PSPACE. Again, since CTL is a fragment of CTL*, it follows that the problem for CTL is also in PSPACE. Those results allow to conclude that for CTL* and CTL, the model checking problem is PSPACE-complete. Several theorems and model checking have been used to prove this complexity.