Fair computational tree logic: Difference between revisions

Content deleted Content added
Addbot (talk | contribs)
m Bot: Removing Orphan Tag (Report Errors)
No edit summary
Line 20:
: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.
 
: 2. M<sub>f</sub>,s<sub>i</sub> |= E<math>\phi</math> if and only if <math>\phi</math> holds in one oreor more fair paths.
 
A fair state is one from which at least one fair path originates. The is translatable to, M<sub>f</sub>,s |= EGtrue