Revision as of 16:26, 18 April 2010 edit Ɯ (talk \| contribs) 178 edits mNo edit summary ← Previous edit		Revision as of 16:37, 18 April 2010 edit undo Ɯ (talk \| contribs) 178 edits numbers back to bullets (all of the set definitions should be alike, even though there are dependencies between some of them). Next edit →
Line 23: Declaratively, the algorithm can be presented as follows. Three sets of tasks are determined: #* <math>T_W</math> is the set of all tasks which occur in at least one trace #* <math>T_I</math> is the set of all tasks which occur trace-initially #* <math>T_O</math> is the set of all tasks which occur trace-terminally Basic ordering relations are determined (<math>\succ_{W}</math> first, the latter three can be constructed therefrom)

Alpha algorithm: Difference between revisions