Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

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

Broader (2)

Logic in computer scienceTemporal logic

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Design and verification of Cyber-Physical Systems using TrueTime, evolutionary optimization and UPPAAL
2016
2016
Model Checking Computational Tree Logic Using Sticker Automata
The molecular computing has been successfully employed to solve more and more complex computation problems. However, as an… 
2015
2015
Verifying Smart Sensory Systems on Cloud Computing Frameworks
2011
2011
Paraconsistent Computation Tree Logic
It is known that paraconsistent logical systems are more appropriate for inconsistency-tolerant and uncertainty reasoning than… 
2010
2010
Paraconsistent Negation and Classical Negation in Computation Tree Logic
A paraconsistent computation tree logic, PCTL, is obtained by adding paraconsistent negation to the standard computation tree… 
2005
2005
Refining the Undecidability Frontier of Hybrid Automata
Reachability becomes undecidable in hybrid automata (HA) that can simulate a Turing (TM) or Minsky (MM) machine. Asarin and… 
2003
2003
Open computation tree logic with fairness
One of the main concerns of the designer of a circuit module is to guarantee that the interface of the module conforms to… 
2002
2002
Modelling PRS-Like Agents' Mental States
In recent years, there have been increased efforts towards defining rigorous operational semantics for a range of agent… 
1996
1996
Axiomatising Extended Computation Tree Logic
We present a sound and complete axiomatisation for extended computation tree logic. This language extends the standard… 
1988
1988
Computation tree logic and regular omega-languages
The expressive power of branching time logics is studied in the framework of the theory of ω-automata and ω-languages. The… 
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)