Fair computational tree logic: Difference between revisions

Revision as of 15:21, 26 January 2007

Revision as of 15:30, 26 January 2007

Line 1:

Fair Computational tree logic is conventional [http://en.wikipedia.org/wiki/Computational_tree_logic Computational tree logic] studied with explicit fairness constraints.

==Weak fairness / Justice==

==References==

This declares conditions such as all processes are executing infinite often. If you consider the processes to be P_i, then the condition becomes <br /><math>\bigwedge GFP_{i}</math>

==Strong fairness / Compassion==

Here, if a process is requesting a resource infinitely often (T), it should be allowed to get the resource (C)infinitely often <br />

<math>\bigwedge( GFR \longrightarrow GFC</math>

==References==