Fair computational tree logic is conventional computational tree logic studied with explicit fairness constraints.
Contents
Weak fairness / justice
This declares conditions such as all processes are executing infinitely often. If you consider the processes to be Pi, then the condition becomes:
Strong fairness / compassion
Here, if a process is requesting a resource infinitely often (R), it should be allowed to get the resource (C) infinitely often:
Model checking for fair CTL
If you consider a Kripke Model, the fair Kripke Model has a set of States F. A path
Fair CTL model checking restricts the checks to only fair paths. There are two kinds:
A fair state is one from which at least one fair path originates. This translates to Mf,s |= EGtrue.
SCC-based approach
The strongly connected component (SCC) of a directed graph is a maximally connected graph - all the nodes are reachable from each other. A fair SCC is one that has an edge into at least one node for each of the fair conditions.
To check for fair EG for any formula,
- Compute what is called the denotation of the formula. Basically all the states such that M, s |= formula.
- restrict the model to the denotation.
- Find the fair SCC.
- Obtain the union of all 3(above).
- Compute the states that can reach the union.
Emerson Lei algorithm
The fix point characterization of Exist Globally is given by: [EGφ] = νZ .([φ] ∩ [EXZ ]), which is basically the limit applied according to Kleene's theorem. To fair paths, it becomes [Ef Gφ] = νZ .([φ] ∩Fi ∈FT [EX[E(Z U(Z ∧ Fi ))]) which means the formula holds in the current state and the next states and the next to next states until it meets all the members of the fair conditions. This means that, the condition is equivalent to a sort of accepting point where the accepting condition is the entire set of Fair conditions.