Statements (27)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:logic
|
| gptkbp:abbreviation |
gptkb:CTL*
|
| gptkbp:complexity |
model checking is PSPACE-complete
|
| gptkbp:describes |
properties of computation trees
|
| gptkbp:expressiveness |
more expressive than CTL and LTL
|
| gptkbp:extendsTo |
gptkb:Linear_Temporal_Logic
gptkb:Computation_Tree_Logic |
| gptkbp:field |
gptkb:logic
computer science formal verification |
| gptkbp:hasSubgroup |
gptkb:Monadic_Second-Order_Logic
|
| gptkbp:hasSyntax |
combines path and state formulas
|
| https://www.w3.org/2000/01/rdf-schema#label |
Computation Tree Logic*
|
| gptkbp:introducedIn |
1983
|
| gptkbp:operator |
F (eventually)
G (globally) R (release) U (until) X (next) A (for all paths) E (there exists a path) |
| gptkbp:publishedIn |
E. A. Emerson and J. Y. Halpern, 1983
|
| gptkbp:relatedTo |
gptkb:Kripke_structure
model checking algorithms |
| gptkbp:usedFor |
model checking
|
| gptkbp:bfsParent |
gptkb:CTL*
|
| gptkbp:bfsLayer |
6
|