Computation tree logic

Known as: CTL, Computational tree logic 
Computation tree logic (CTL) is a branching-time logic, meaning that its model of time is a tree-like structure in which the future is not determined… (More)
Wikipedia

Related topics

Related topics

23 relations
Alternating-time Temporal LogicAtomic formulaCTL*Context-free grammar
(More)

Broader (2)

Logic in computer scienceTemporal logic

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Graded Computation Tree Logic with Binary Coding
Graded path quantifiers have been recently introduced and investigated as a useful framework for generalizing standard… (More)
Is this relevant?
2009
2009
Graded Computation Tree Logic
In modal logics, graded (world) modalities have been deeply investigated as a useful framework for generalizing standard… (More)
Is this relevant?
2009
2009
Paraconsistent Computation Tree Logic
It is known that paraconsistent logical systems are more appropriate for inconsistency-tolerant and uncertainty reasoning than… (More)
  • figure 1
Is this relevant?
2007
2007
One-Pass Tableaux for Computation Tree Logic
We extend Schwendimann’s single-pass decision procedure for propositional linear temporal logic (PLTL) to give a single-pass… (More)
  • table 1
Is this relevant?
2007
2007
Computation Tree Logic with Deadlock Detection
We study the equivalence relation on states of labelled transition systems of satisfying the same formulas in Computation Tree… (More)
Is this relevant?
2006
2006
Natural Deduction Calculus for Computation Tree Logic
The authors present a natural deduction calculus for the computation tree logic, CTL, defined with the full set of classical and… (More)
Is this relevant?
2006
2006
Model Checking Quantified Computation Tree Logic
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over… (More)
  • figure 1
  • figure 2
Is this relevant?
2002
2002
Quantified Computation Tree Logic
Computation Tree Logic (CTL) is one of the most syntactically elegant and computationally attractive temporal logics for… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2001
Highly Cited
2001
An Axiomatization of Full Computation Tree Logic
We give a sound and complete axiomatization for the full computation tree logic, CTL*, of R-generable models. This solves a long… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary Tree
In this paper we study the expressive power of the full branching time logic CTL* (of Clarke, Emerson, Halpern and Sistla), by… (More)
Is this relevant?