Revision as of 16:14, 20 November 2013 edit 129.88.107.93 (talk) No edit summary ← Previous edit		Revision as of 16:16, 20 November 2013 edit undo 129.88.107.93 (talk) No edit summary Next edit →
Line 22: : 2. M<sub>f</sub>,s<sub>i</sub> \|= E<math>\phi</math> if and only if <math>\phi</math> holds in one or more fair paths. A fair state is one from which at least one fair path originates. ~~The~~This ~~is translatable~~translates to, M<sub>f</sub>,s \|= EGtrue. ==SCC-based approach==

Fair computational tree logic: Difference between revisions