<?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="Concurrency (computer science) - Page 13 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Concurrency_(computer_science)&amp;p=12">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Concurrency_%28computer_science%29&amp;p=14">3.Next</a>
</p>
<p>allow assertions to be made about the sequences of states that a concurrent system can pass through. Others, such as <a href="page.php?w=action_computational_tree_logic">action computational tree logic</a>, <a href="page.php?w=Hennessy-Milner_logic">Hennessy-Milner logic</a>, and <a href="page.php?w=Leslie_Lamport">Lamport's</a> <a href="page.php?w=temporal_logic_of_actions">temporal logic of actions</a>, build their assertions from sequences of actions (changes in state). The principal application of these logics is in writing specifications</p><p>
<a accesskey="1" href="page.php?w=Concurrency_(computer_science)&amp;p=12">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Concurrency_%28computer_science%29&amp;p=14">3.Next</a>
</p>

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

</card>
</wml>
