Constructing a Bidirectional Transformation Between BPMN and BPEL With a Functional Logic Programming Language

In this paper, the authors show how functional logic programming techniques can be used to construct a bidirectional transformation between structured process models of the Business Process Modeling Notation (BPMN) and executable models of the Business Process Execution Language (BPEL). They specify the abstract syntax of structured process models by a context-free hypergraph grammar. This grammar can be subsequently transformed into a graph parser using their previously developed Grappa framework of functional logic GRAPh PArser combinators.