Fair computational tree logic

This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. Please help improve this article by introducing more precise citations. (April 2023) (Learn how and when to remove this message)

Fair computational tree logic is conventional computational tree logic studied with explicit fairness constraints.

This declares conditions such as all processes execute infinitely often. If you consider the processes to be P_i, then the condition becomes:

${\displaystyle \bigwedge GFP_{i}}$

Here, if a process is requesting a resource infinitely often (R), it should be allowed to get the resource (C) infinitely often:

${\displaystyle \bigwedge (GFR\longrightarrow GFC)}$

Consider a Kripke model with set of states F. A path ${\displaystyle \pi =s_{o},s_{1}\dots }$ is considered a fair path, if and only if the path includes all members of F infinitely often.
Fair CTL model checking restricts the checks to only fair paths. There are two kinds of fair quantifiers:

1. M_f, s_i |= A${\displaystyle \phi }$ if and only if ${\displaystyle \phi }$ holds in all fair paths.

2. M_f, s_i |= E${\displaystyle \phi }$ if and only if ${\displaystyle \phi }$ holds in one or more fair paths.

A fair state is one from which at least one fair path originates. This translates to M_f, s |= EGtrue.

A strongly connected component (SCC) of a directed graph is a maximal strongly connected subgraph—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,

1. Compute what is called the denotation of the formula φ: the set of states such that M, s |= φ.
2. Restrict the model to the denotation.
3. Find the fair SCC.
4. Obtain the union of all 3 (above).
5. Compute the states that can reach the union.

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.

• Emerson, E. A.; Halpern, J. Y. (1985). "Decision procedures and expressiveness in the temporal logic of branching time". Journal of Computer and System Sciences. 30 (1): 1–24. doi:10.1016/0022-0000(85)90001-7.
• Clarke, E. M.; Emerson, E. A. & Sistla, A. P. (1986). "Automatic verification of finite-state concurrent systems using temporal logic specifications". ACM Transactions on Programming Languages and Systems. 8 (2): 244–263. doi:10.1145/5397.5399. S2CID 52853200.