Revision as of 18:20, 6 December 2020 edit 2001:861:3ac0:4fa0:f1cb:b0bb:ca58:2a11 (talk) No edit summary ← Previous edit		Revision as of 18:20, 6 December 2020 edit undo 2001:861:3ac0:4fa0:f1cb:b0bb:ca58:2a11 (talk) No edit summary Next edit →
Line 4: This declares conditions such as all processes execute infinitely often. If you consider the processes to be P<sub>i</sub>, then the condition becomes: :<math>\bigwedge ~~EFP_~~GFP_{i}</math> ==Strong fairness / compassion==

Fair computational tree logic: Difference between revisions