Need a more compact BPM flow than the one over here.

Question

This is the BPM i have encountered with.
The parameters for the steps are :
1. Start: One Queue
1. Loop: Condition: CO_endloop value: not = true
2. Parallel: End condition; necessary branches : value: 1
3. Fork Start.
4. Receive: message: Collect message; use correlation: Correlation
5. Append : target: Collectmessagelist; operation: Append
6. loop parameter1: target:Co_endloop;expression:False
7. Wait:duration: 2mins;
8. loop parameter2: target:co_endloop;expression:True
9. Applymapping: source and target messages defined.
10. Send New message: mode:asynchcronous.
11. Stop: One queue.
The graphical definition looks like this:
.................................-> wait(15 minutes) > loop2>
Start--> loop --> Parallel(Fork).....................Parallel Fork END --> loop END --> append >send>Stop
.................................--> receive -->append --> loop1 --->
Kindly show me how this works.
Is it a good flow;Please inform if u can come up with a more reduced BPM for the said requirement.
If we have a similar kind of bpm for another interface,with another branch to add in the parallel node specifying the number or cardinality function(specifying number of idocs to be collected along with the wait condition). how can we do it ?
Please explain.
If there are any  reference materials in any blogs for the same then please post in reply.

Answer 1

This is the BPM i have encountered with.
The parameters for the steps are :
1. Start: One Queue
1. Loop: Condition: CO_endloop value: not = true
2. Parallel: End condition; necessary branches : value: 1
3. Fork Start.
4. Receive: message: Collect message; use correlation: Correlation
5. Append : target: Collectmessagelist; operation: Append
6. loop parameter1: target:Co_endloop;expression:False
7. Wait:duration: 2mins;
8. loop parameter2: target:co_endloop;expression:True
9. Applymapping: source and target messages defined.
10. Send New message: mode:asynchcronous.
11. Stop: One queue.
The graphical definition looks like this:
.................................-> wait(15 minutes) > loop2>
Start--> loop --> Parallel(Fork).....................Parallel Fork END --> loop END --> append >send>Stop
.................................--> receive -->append --> loop1 --->
Kindly show me how this works.
Is it a good flow;Please inform if u can come up with a more reduced BPM for the said requirement.
If we have a similar kind of bpm for another interface,with another branch to add in the parallel node specifying the number or cardinality function(specifying number of idocs to be collected along with the wait condition). how can we do it ?
Please explain.
If there are any  reference materials in any blogs for the same then please post in reply.