Hi,
I recently have competed with a Curry solution at the GraBaTs 2009
tool contest (
http://is.tm.tue.nl/staff/pvgorp/events/grabats2009/).
One of the challenges had been to write a transformation from BPMN
(Business Process Modeling Notation) to BPEL (Business Process
Execution Language) using a graph-based tool. Whereas the former
language has a graph structure the latter is block-structured -- this
actually is the major difficulty here.
>From 10 submitted solutions the Curry solution based on graph parser
combinators (
http://www.unibw.de/steffen.mazanek/forschung/grappa) won
the third place. Its main distinguishing features are readability
(although this was not really acknowledged by the jury consisting of
people not familiar with Curry and parser combinators) and
bidirectionality. Actually, the Curry solution was the only one being
bidirectional without any extra effort (thanks to logic programming).
More concretely, this means that a BPMN graph can be generated from a
BPEL structure simply by reverse applying the parser. Performance has
also been acceptable (I have used the Münster Curry Compiler).
The description of this solution is provided here:
http://www.steffen-mazanek.de/publications/2009-GraBaTs-2.pdf
Ciao,
Steffen
--
Dipl.-Inform. Steffen Mazanek
Institut für Softwaretechnologie
Fakultät Informatik
Universität der Bundeswehr München
85577 Neubiberg
Tel: +49 (0)89 6004-2505
Fax: +49 (0)89 6004-4447
E-Mail: steffen.mazanek_at_unibw.de
_______________________________________________
curry mailing list
curry_at_lists.RWTH-Aachen.DE
http://MailMan.RWTH-Aachen.DE/mailman/listinfo/curry
Received on Mo Jul 20 2009 - 09:50:08 CEST