Different from Rete-based in BizTalk AlgorithmAnd WF only uses
Deduction of priorityProcess to analyze the results. It is based on the object instance rather than the type.
1) First, sort the rule in the ruleset by priority. If the priority is the same,Sort by the name of the rule.. And all pending tags are set to true (meaning whether the current rule action has been executed and can be used as a candidate for re-execution ).
2) Calculate the condition of rule in sequence, Every time rule. condition = true: Execute then action. If it is false, execute else action (if it exists). If action (whether it is thenaction or else action), set pending flag to false.
3) Evaluate the conclusion of executing the action and determine whether the condition of some rule with a higher priority. If so, and this rule does not meet the reevaluation = Nevel & pending = false condition (that is, the condition to be selected is met ), then execute it (of course, this rule may also affect the conditions of other rule, recursively ).
4) when the execution of all affected rule is completed, re-execute the next rule.
5) until the last rule (and its affacted rules) is executed.