Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,000,554 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
23 relations
Alternating-time Temporal Logic
Atomic formula
CTL*
Context-free grammar
Expand
Broader (2)
Logic in computer science
Temporal logic
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Paraconsistent Computation Tree Logic
K. Kaneiwa
,
N. Kamide
New generation computing
2011
Corpus ID: 10304002
It is known that paraconsistent logical systems are more appropriate for inconsistency-tolerant and uncertainty reasoning than…
Expand
Highly Cited
2011
Highly Cited
2011
Reasoning About Strategies: On the Model-Checking Problem
F. Mogavero
,
A. Murano
,
Giuseppe Perelli
,
Moshe Y. Vardi
TOCL
2011
Corpus ID: 9227152
In open systems verification, to formally check for reliability, one needs an appropriate formalism to model the interaction…
Expand
2010
2010
Extended Computation Tree Logic
Roland Axelsson
,
M. Hague
,
S. Kreutzer
,
M. Lange
,
Markus Latte
Logic Programming and Automated Reasoning
2010
Corpus ID: 2618056
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators…
Expand
2009
2009
Graded Computation Tree Logic
A. Bianco
,
F. Mogavero
,
A. Murano
24th Annual IEEE Symposium on Logic In Computer…
2009
Corpus ID: 6603189
In modal logics, graded (world) modalities have been deeply investigated as a useful framework for generalizing standard…
Expand
2009
2009
Computation Tree Logic with Deadlock Detection
R. V. Glabbeek
,
B. Luttik
,
N. Trcka
Log. Methods Comput. Sci.
2009
Corpus ID: 5177441
We study the equivalence relation on states of labelled transition systems of satisfying the same formulas in Computation Tree…
Expand
2006
2006
Model Checking Quantified Computation Tree Logic
A. Rensink
International Conference on Concurrency Theory
2006
Corpus ID: 18576683
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over…
Expand
Review
2004
Review
2004
On Probabilistic Computation Tree Logic
Frank Ciesinski
,
Marcus Größer
Validation of Stochastic Systems
2004
Corpus ID: 30548386
In this survey we motivate, define and explain model checking of probabilistic deterministic and nondeterministic systems using…
Expand
Highly Cited
2001
Highly Cited
2001
An axiomatization of full Computation Tree Logic
Mark Reynolds
Journal of Symbolic Logic (JSL)
2001
Corpus ID: 37041207
Abstract We give a sound and complete axiomatization for the full computation tree logic. CTL*, of R-generable models. This…
Expand
Review
1996
Review
1996
Model Checking Timed Automata
S. Yovine
European Educational Forum
1996
Corpus ID: 11315145
The theory of timed automata provides a formal framework to model and to verify the correct functioning of real-time systems…
Expand
Highly Cited
1982
Highly Cited
1982
Decision procedures and expressiveness in the temporal logic of branching time
E. Emerson
,
Joseph Y. Halpern
Symposium on the Theory of Computing
1982
Corpus ID: 2160332
In this paper we consider the Computation Tree Logic (CTL) proposed in [CE] which extends the Unified Branching Time Logic (UB…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE