I'd go for (3). The API you are looking for is org.jbpm.jpdl.xml.JpdlXmlWriter. The problem is, this class is deprecated because there is no real need for it. You might as well build a DOM tree instead of a process definition object. Here is a first attempt at the algorithm for your program: For each process definition p: Look for a node n in the target document whose name matches the name of p If n does not exist, create it For each subprocess sp in p: Look for a node sn in the target document whose name matches the name of sp If sn does not exist, create it Create a transition from n to sn No need for recursion, because you are iterating over all process definitions. If you know the "root" processes beforehand, you can develop a version of this algorithm that probably performs better. Hope this helps. View the original post : http://www.jboss.com/index.html?module=bb&op=viewtopic&p=4110066#... Reply to the post : http://www.jboss.com/index.html?module=bb&op=posting&mode=reply&a...