Comments on: Roundtripping Update http://www.brsilver.com/wordpress/2006/10/12/roundtripping-update/ Bruce Silver's blog on business process management Sat, 22 Nov 2008 00:43:22 +0000 http://wordpress.org/?v=2.5.1 By: Antoine’s » links for 2006-10-18 http://www.brsilver.com/wordpress/2006/10/12/roundtripping-update/#comment-284 Antoine’s » links for 2006-10-18 Sun, 22 Oct 2006 11:25:25 +0000 http://www.brsilver.com/wordpress/2006/10/12/roundtripping-update/#comment-284 [...] BPMN to BPEL transformation Hw to transform BPMN to BPEL… if you can ! (tags: bpmn work research development) These icons link to social bookmarking sites where readers can share and discover new web pages. [...] [...] BPMN to BPEL transformation Hw to transform BPMN to BPEL… if you can ! (tags: bpmn work research development) These icons link to social bookmarking sites where readers can share and discover new web pages. [...]

]]> By: ygao http://www.brsilver.com/wordpress/2006/10/12/roundtripping-update/#comment-257 ygao Mon, 16 Oct 2006 05:45:06 +0000 http://www.brsilver.com/wordpress/2006/10/12/roundtripping-update/#comment-257 As I stated in <a href="http://www.eclarus.com/pdf/BPMN_BPEL_Mapping.pdf" rel="nofollow">my white paper</a>, not all BPMN diagrams can be mapped onto BPEL processes isomorphically. So it is impossible to get the same diagrams after round-tripping without cluttering the BPEL files with annotations or equivalents. However, those diagrams that can be isomorphically translated cover the most real use cases. They are a reflection of what BPEL can do. Comparing with <a href="http://itredux.com/blog/2006/02/03/the-next-step-in-process-modeling/#comments" rel="nofollow"> Marlon's classification</a>, isomorphic diagrams are a subset of Class2, but a superset of  Class3. Class 3 can be translated to BPEL using context-free pattern matching algorithm. However, the algorithm is not effective for diagrams of parallel processing with synchronization links, which belong to Class 2. <a href="http://www.flickr.com/photos/68312898@N00/270800770/" rel="nofollow">One example</a> is shown in my previous post. It can be isomorphically mapped onto BPEL constructs. That is what <a href="http://www.eclarus.com" rel="nofollow">eClarus</a> product can solve. Some diagrams in Class 2 cannot be mapped isomorphically onto BPEL. Please look at <a href="http://www.flickr.com/photos/68312898@N00/271000777/" rel="nofollow">this diagram</a>. It is semantically equivalent to the <a href="http://www.flickr.com/photos/68312898@N00/270800770/" rel="nofollow">one</a> in my previous post. In this case, we can redraw the diagram as an isomorphic one, and then translate it to BPEL. Fortunately, we tend to draw the diagram structurally since it is natural for us to decompose a complex problem into small pieces Practically, you can first draw a parallel processing diagram using Class 3 components, and then add the synchronization links if any. eClarus product can translate it to a "readable" BPEL using its advanced algorithm. Also I want to clarify the my previous post on our algorithm. In the diagram, without the synchronization links, it is a Class3. and it can be mapped to a "readable" BPEL using the algorithm Marlon mentioned. After the Class3 mapping, we add the links the the result BPEL. As I stated in my
white paper, not all BPMN diagrams can be mapped onto BPEL processes
isomorphically. So it is impossible to get the same diagrams after
round-tripping without cluttering the BPEL files with annotations or
equivalents. However, those diagrams that can be isomorphically translated cover
the most real use cases. They are a reflection of what BPEL can do.

Comparing with

Marlon’s classification, isomorphic diagrams are a subset of Class2, but a
superset of  Class3. Class 3 can be translated to BPEL using context-free
pattern matching algorithm. However, the algorithm is not effective for diagrams
of parallel processing with synchronization links, which belong to Class 2.
One example
is shown in my previous post. It can be isomorphically mapped onto BPEL
constructs. That is what eClarus product
can solve.

Some diagrams in Class 2 cannot be mapped isomorphically onto BPEL. Please
look at this
diagram. It is semantically equivalent to the
one in my
previous post. In this case, we can redraw the diagram as an isomorphic one, and
then translate it to BPEL. Fortunately, we tend to draw the diagram structurally
since it is natural for us to decompose a complex problem into small pieces

Practically, you can first draw a parallel processing diagram using Class 3
components, and then add the synchronization links if any. eClarus product can
translate it to a "readable" BPEL using its advanced algorithm.

Also I want to clarify the my previous post on our algorithm. In the diagram,
without the synchronization links, it is a Class3. and it can be mapped to a
"readable" BPEL using the algorithm Marlon mentioned. After the Class3 mapping,
we add the links the the result BPEL.

]]> By: ygao http://www.brsilver.com/wordpress/2006/10/12/roundtripping-update/#comment-255 ygao Mon, 16 Oct 2006 05:34:06 +0000 http://www.brsilver.com/wordpress/2006/10/12/roundtripping-update/#comment-255 As I stated in <a href="http://www.eclarus.com/pdf/BPMN_BPEL_Mapping.pdf" rel="nofollow">my white paper</a>, not all BPMN diagrams can be mapped onto BPEL processes isomorphically. So it is impossible to get the same diagrams after round-tripping without cluttering the BPEL files with annotations or equivalents. However, those diagrams that can be isomorphically translated cover the most real use cases. They are a reflection of what BPEL can do. Comparing with <a href="http://itredux.com/blog/2006/02/03/the-next-step-in-process-modeling/#comments" rel="nofollow"> Marlon's classification</a>, isomorphic diagrams are a subset of Class2, but a superset of  Class3. Class 3 can be translated to BPEL using context-free pattern matching algorithm. However, the algorithm is not effective for diagrams of parallel processing with synchronization links, which belong to Class 2. <a href="http://www.flickr.com/photos/68312898@N00/270800770/" rel="nofollow">One example</a> is shown in my previous post. It can be isomorphically mapped onto BPEL constructs. That is what <a href="http://www.eclarus.com" rel="nofollow">eClarus</a> product can solve. Some diagrams in Class 2 cannot be mapped isomorphically onto BPEL. Please look at <a href="http://www.flickr.com/photos/68312898@N00/271000777/" rel="nofollow">this diagram</a>. It is semantically equivalent to the <a href="http://www.flickr.com/photos/68312898@N00/270800770/" rel="nofollow">one</a> in my previous post. In this case, we can redraw the diagram as an isomorphic one, and then translate it to BPEL. Fortunately, we tend to draw the diagram structurally since it is natural for us to decompose a complex problem into small pieces Practically, you can first draw a parallel processing diagram using Class 3 components, and then add the synchronization links if any. eClarus product can translate it to a "readable" BPEL using its advanced algorithm. Also I want to clarify the my previous post on our algorithm. In the diagram, without the synchronization links, it is a Class3. and it can be mapped to a "readable" BPEL using the algorithm Marlon mentioned. After the Class3 mapping, we add the links the the result BPEL. As I stated in my
white paper, not all BPMN diagrams can be mapped onto BPEL processes
isomorphically. So it is impossible to get the same diagrams after
round-tripping without cluttering the BPEL files with annotations or
equivalents. However, those diagrams that can be isomorphically translated cover
the most real use cases. They are a reflection of what BPEL can do.
Comparing with

Marlon’s classification, isomorphic diagrams are a subset of Class2, but a
superset of  Class3. Class 3 can be translated to BPEL using context-free
pattern matching algorithm. However, the algorithm is not effective for diagrams
of parallel processing with synchronization links, which belong to Class 2.
One example
is shown in my previous post. It can be isomorphically mapped onto BPEL
constructs. That is what eClarus product
can solve.
Some diagrams in Class 2 cannot be mapped isomorphically onto BPEL. Please
look at this
diagram. It is semantically equivalent to the
one in my
previous post. In this case, we can redraw the diagram as an isomorphic one, and
then translate it to BPEL. Fortunately, we tend to draw the diagram structurally
since it is natural for us to decompose a complex problem into small pieces
Practically, you can first draw a parallel processing diagram using Class 3
components, and then add the synchronization links if any. eClarus product can
translate it to a "readable" BPEL using its advanced algorithm.
Also I want to clarify the my previous post on our algorithm. In the diagram,
without the synchronization links, it is a Class3. and it can be mapped to a
"readable" BPEL using the algorithm Marlon mentioned. After the Class3 mapping,
we add the links the the result BPEL.

]]> By: BPMS Watch » More on eClarus and Class 2 Roundtripping http://www.brsilver.com/wordpress/2006/10/12/roundtripping-update/#comment-249 BPMS Watch » More on eClarus and Class 2 Roundtripping Fri, 13 Oct 2006 23:16:17 +0000 http://www.brsilver.com/wordpress/2006/10/12/roundtripping-update/#comment-249 [...] Re yesterday’s post, Yi Gao of eClarus wanted to get this image in his response, so I’m posting the following note on his behalf. [...] [...] Re yesterday’s post, Yi Gao of eClarus wanted to get this image in his response, so I’m posting the following note on his behalf. [...]

]]>