Quantified Computation Tree Logic
โ
A.C. Patthak; I. Bhattacharya; A. Dasgupta; Pallab Dasgupta; P.P. Chakrabarti
๐
Article
๐
2002
๐
Elsevier Science
๐
English
โ 109 KB
Computation Tree Logic (CTL) is one of the most syntactically elegant and computationally attractive temporal logics for branching time model checking. In this paper, we observe that while CTL can be verified in time polynomial in the size of the state space times the length of the formula, there is