Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

23 relations
Alternating-time Temporal LogicAtomic formulaCTL*Context-free grammar
Expand

Broader (2)

Logic in computer scienceTemporal logic

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Extended Computation Tree Logic
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators… Expand
  • figure 1
  • figure 2
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… Expand
  • figure 2
  • figure 4
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… Expand
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… Expand
  • figure 1
Is this relevant?
2009
2009
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
Exogenous Probabilistic Computation Tree Logic
Abstract We define a logic EpCTL for reasoning about the evolution of probabilistic systems. System states correspond to… Expand
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… Expand
  • 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… Expand
  • 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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1996
1996
Axiomatising Extended Computation Tree Logic
We present a sound and complete axiomatisation for extended computation tree logic. This language extends the standard… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE