Revision as of 15:38, 26 January 2007 edit Grokmenow (talk \| contribs) 125 edits No edit summary ← Previous edit		Revision as of 15:40, 26 January 2007 edit undo Grokmenow (talk \| contribs) 125 edits No edit summary Next edit →
Line 15: 1. M<sub>f</sub>,s<sub>i</sub> \|= A<math>\phi</math> if and only if <math>\phi</math> holds in ALL fair paths. <br/> 2. M<sub>f</sub>,s<sub>i</sub> \|= E<math>\phi</math> if and only if <math>\phi</math> holds in one ore more fair paths. <br/> A fair state is one from which atleast one fair path originates. The is translatable to, M<sub>f</sub>,s \|= EGtrue <br /> ==References==

Fair computational tree logic: Difference between revisions