BPEL does not mandate any non-functional requirement, so this feature does not violate the spec. BPML? Err... Let's not talk about the dead :-)
Actually, backtracking is required to implement any graph traversal. Think of the classic maze example taught in computer science courses. To find the exit, you need to be able to "remember" every location you've been before, so that you can walk back and try a different path when you find a dead end. The simplest technique to implement backtracking is recursive calls. Business process graphs have light to moderate complexity and are mostly acyclic, so this technique is adequate. Orchestration graphs resemble flow charts, which are highly cyclic. They quickly show the limitations of the simple backtracking technique as in your case. Rather than pushing to change the graph implementation at the core of jBPM, with the refactoring that would imply, I will change the while structure so that it does not build on the stack. Can you open another JIRA issue here? View the original post : http://www.jboss.com/index.html?module=bb&op=viewtopic&p=3921909#3921909 Reply to the post : http://www.jboss.com/index.html?module=bb&op=posting&mode=reply&p=3921909 ------------------------------------------------------- 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
