Done, http://jira.jboss.com/jira/browse/BPEL-92.
I used the same approach when I worked on a BPML engine few years ago (graph oriented programming), but the loops (while, until) had inner stacks, so the maximum inner stack size was equal to the number of activities the loop had. Eventually pushed the process instances (BPML allows call) for an eventual compensation! It is my favorite programming method, as it allows fast development for quite complex issues. Backtracking, state machines, type 3 grammar parsers, and branch-and-bound are a breeze. But, I noticed over the years that at enterprise level this approach is risky since it requires large stacks - and the data base can be huge, easy run out of memory. Ever since I try to avoid it, and use good old Knuth techniques; also, this method it is incredible difficult to explain (knowledge transfer) to others -- very surprised to notice that. I will hit you soon with another suite of issues I found with BPEL implementation, hope you don't mind. Regards, AA View the original post : http://www.jboss.com/index.html?module=bb&op=viewtopic&p=3921949#3921949 Reply to the post : http://www.jboss.com/index.html?module=bb&op=posting&mode=reply&p=3921949 ------------------------------------------------------- This SF.net email is sponsored by: Splunk Inc. Do you grep through log files for problems? Stop! Download the new AJAX search engine that makes searching your log files as easy as surfing the web. DOWNLOAD SPLUNK! http://sel.as-us.falkag.net/sel?cmd=lnk&kid=103432&bid=230486&dat=121642 _______________________________________________ JBoss-user mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/jboss-user
