Revision as of 03:31, 24 July 2012 edit ChrisGualtieri (talk \| contribs) Pending changes reviewers, Rollbackers 457,369 edits m →Emerson Lei algorithm: Typo fixing, typos fixed: , → , using AWB ← Previous edit		Revision as of 20:33, 12 December 2012 edit undo 131.193.36.97 (talk) →Model checking for fair CTL Next edit →
Line 14: ==Model checking for fair CTL== If you consider a Kripke Model, the fair Kripke Model has a set of States F. A path <math>\pi = sos_o, s1s_1 \dots</math> is considered a fair path, if and only if the path includes all members of F infinitely often. <br/> Fair CTL model checking restricts the checks to only fair paths. There are two kinds:

Fair computational tree logic: Difference between revisions