Hi,
I do not reallt know whether there is a native way in jBPM to implement the
"m out of n"-case you are describing. Anyway, imho, the easiest way to
roundtrip this is probably this:
Create a series of simple decision gateways: If(A has to execute), fire A;
else do nothing; If (B has to execute); fire B; else do nothing;...
Each time a task is not to be execute, the token will follow an "empty"
path. You can use the or convergence to join the branches together again and
lead them to the next divergence.
Hope this helps.
Regards,
Frank
dcrissman wrote:
Swindells, Thomas wrote:
>
> Can you split it into two separate diverges?
> Diverge to B first and always follow the other path which then does the A
> & C,
> Similarly at the other end wait for A &C and then a second wait to add in
> the condition for B.
>
> Thomas
>
I am not sure I entirely follow your suggestion. A, B, & C could fire in
any combination, but always at least one.
--
View this message in context:
http://drools.46999.n3.nabble.com/Rule-Flow-Diverge-Converge-Issue-with-o...
Sent from the Drools: User forum mailing list archive at
Nabble.com.