Hey John, Yes doing it the other way around is interesting to say the least.
I have been trying several approaches. XSL is not one of them :) It appears that you need to reduce the size of the graph iteratively. Find consecutive tasks -> sequence Find merge and corresponding split and assemble in concurrence or "if" And keep iterating until you get only one block between the start and the end. It seems that the requirement is to have only one start and one end. So far I can do some fairly simple diagrams... Wdyt? Pat. > From: John Mettraux <[EMAIL PROTECTED]> > Reply-To: <[email protected]> > Date: Thu, 26 Jul 2007 09:53:42 +0900 > To: <[email protected]> > Subject: [openwferu-dev] Re: Converting BPMN graph to OpenWFERu > > > On 7/25/07, cappelaere <[EMAIL PROTECTED]> wrote: >> >> This is turning out to be pretty hard (at least at first look for >> me). It seems to get hairy with timeouts, exceptions fairly >> quickly... XOR or Sync Merging might require to backtrace... >> I am wondering if anyone has some experience to share or some pointers >> to follow. > > Hello Pat, > > I've been thinking about it. I have experience in turning block > structured stuff into graphs, but not the other way. > > Are you taking an XSL or a programmatic approach ? > > -- > John Mettraux -///- http://jmettraux.openwfe.org > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "OpenWFEru dev" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/openwferu-dev?hl=en -~----------~----~----~----~------~----~------~--~---
