Revision as of 18:41, 31 January 2011 edit Ruud Koot (talk \| contribs) 31,416 edits {{mergeto\|Model checking}} ← Previous edit		Revision as of 19:02, 31 January 2011 edit undo AnomieBOT (talk \| contribs) Bots 6,856,179 edits m Dating maintenance tags: {{Mergeto}} Next edit →
Line 1: {{mergeto\|Model checking\|date=January 2011}} {{Orphan\|date=February 2009}} '''Fair computational tree logic''' is conventional [[computational tree logic]] studied with explicit fairness constraints.

Fair computational tree logic: Difference between revisions