<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Computation tree logic - Page 1 - Wikipedia">
<p>
<a accesskey="3" href="page.php?w=computation_tree_logic&amp;p=2">3.Next</a>
</p>
<p> </p>

<p><b>Computation tree logic</b> (<b>CTL</b>) is a branching-time <a href="page.php?w=Mathematical_logic">logic</a>, meaning that its model of <a href="page.php?w=time">time</a> is a <a href="page.php?w=tree_%28graph_theory%29">tree-like</a> structure in which the future is not determined; there are different paths in the future, any one of which might be an actual path that is realized. It is used in <a href="page.php?w=formal_verification">formal verification</a> of software or hardware artifacts, typically by software applications known</p><p>
<a accesskey="3" href="page.php?w=computation_tree_logic&amp;p=2">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
