Fair computational tree logic: Difference between revisions

Content deleted Content added
Grokmenow (talk | contribs)
No edit summary
Grokmenow (talk | contribs)
No edit summary
Line 34:
To fair paths, it becomes - <br/>
[Ef Gφ] = νZ .([φ] ∩<sub>Fi ∈FT</sub> [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.