Constructing a bidirectional transformation between BPMN and BPEL with a functional logic programming language

Journal of Visual Languages and Computing

Volumn 22, Issue 1, 2011, Pages 66-89

  Mazanek, Steffen ^a   Hanus, Michael ^b  

^a BUNDESWEHR UNIVERSITY MUNICH   (Germany)

^b UNIVERSITY OF KIEL   (Germany)

Author keywords

BPEL; BPMN; Business process models; Curry; Functional logic programming; Graph parsing; Parser combinators

Indexed keywords

EID: 79651474058     PISSN: 1045926X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jvlc.2010.11.005     Document Type: Article

References (67)

1. Antoy S., Echahed R., Hanus M. A needed narrowing strategy. Journal of the ACM 2000, 47(4):776-822.
2. Antoy S., Hanus M. Functional logic design patterns. Proceedings of the 6th International Symposium on Functional and Logic Programming, Lecture Notes in Computer Science 2002, vol. 2441:67-87. Springer-Verlag.
3. Antoy S., Hanus M. Functional logic programming. Communications of the ACM 2010, 53(4):74-85.
4. E.J.G. Arias, J.M. Carballo, J.M.R. Poza, A proposal for disequality constraints in Curry, in: Electronic Notes in Theoretical Computer Science, Proceedings of the 15th International Workshop on Functional and (Constraint) Logic Programming, vol. 177, 2007, pp. 269-285.
5. Bardohl R., Minas M., Taentzer G., Schürr A. Application of graph transformation to visual languages. Handbook of Graph Grammars and Computing by Graph Transformation, Applications, Languages, and Tools 1999, vol. 2:105-180. World Scientific.
6. Bottoni P., Meyer B., Marriott K., Parisi-Presicce F. Deductive parsing of visual languages. Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics, Lecture Notes in Computer Science 2001, vol. 2099:79-94. Springer-Verlag.
7. Braßel B., Hanus M., Müller M. High-level database programming in Curry. Proceedings of the Tenth International Symposium on Practical Aspects of Declarative Languages, Lecture Notes in Computer Science 2008, vol. 4902:316-332. Springer-Verlag.
8. Braßel B., Huch F. The Kiel Curry system KiCS. Applications of Declarative Programming and Knowledge Management, Lecture Notes in Computer Science 2009, vol. 5437:195-205. Springer-Verlag.
9. R. Bruni, A.L. Lafuente, U. Montanari, Hierarchical design rewriting with Maude, in: Electronic Notes in Theoretical Computer Science, Proceedings of the Seventh International Workshop on Rewriting Logic and its Applications, vol. 238(3), 2009, pp. 45-62.
10. Caballero R., López-Fraguas F.J. A functional-logic perspective of parsing. Proceedings of the Fourth Fuji International Symposium on Functional and Logic Programming, Lecture Notes in Computer Science 1999, vol. 1722:85-99. Springer-Verlag.
11. Drewes F., Habel A., Kreowski H.-J. Hyperedge replacement graph grammars. Handbook of Graph Grammars and Computing by Graph Transformation, Foundations 1997, vol. I:95-162. World Scientific, (Chapter 2).
12. M. Dumas, Case study: BPMN to BPEL model transformation. (accessed on 2010-07-11), 2009. http://is.ieis.tue.nl/staff/pvgorp/events/grabats2009/cases/grabats2009synthesis.pdf.
13. Fischer S. A functional logic database library. Proceedings of the ACM SIGPLAN 2005 Workshop on Curry and Functional Logic Programming 2005, 54-59. ACM Press.
14. Foster J.N., Greenwald M.B., Moore J.T., Pierce B.C., Schmitt A. Combinators for bi-directional tree transformations: a linguistic approach to the view update problem. Proceedings of the 32nd ACM Symposium on Principles of Programming Languages 2005, 233-246. ACM.
15. L. García-Bañuelos, Translating BPMN models to BPEL code. Accepted as a solution for the synthesis case of the GraBaTs 2009 tool contest, 2009.
16. Girard J.-Y. Linear logic. Theoretical Computer Science 1987, 50:1-102.
17. González-Moreno J., Hortalá-González M., López-Fraguas F., Rodríguez-Artalejo M. An approach to declarative programming based on a rewriting logic. Journal of Logic Programming 1999, 40:47-87.
18. V. Gruhn, R. Laue, Validierung syntaktischer und anderer EPK-Eigenschaften mit PROLOG, in: Proceedings des 5. GI Workshops über Geschäftsprozessmanagement mit Ereignisgesteuerten Prozessketten, CEUR Workshop Proceedings, vol. 224, CEUR-WS.org, 2006, pp. 69-85.
19. Gruhn V., Laue R. What business process modelers can learn from programmers. Science of Computer Programming 2007, 65(1):4-13.
20. Hanus M. A functional logic programming approach to graphical user interfaces. Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages, Lecture Notes in Computer Science 2000, vol. 1753:47-62. Springer-Verlag.
21. Hanus M. High-level server side web scripting in Curry. Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages, Lecture Notes in Computer Science 2001, vol. 1990:76-92. Springer-Verlag.
22. M. Hanus, Curry: an integrated functional logic language (Version 0.8.2) (accessed on 2010-07-11), 2006. http://www.curry-language.org/.
23. Hanus M. Type-oriented construction of web user interfaces. Proceedings of the Eighth ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming 2006, 27-38. ACM Press.
24. Hanus M. Multi-paradigm declarative languages. Proceedings of the 23rd International Conference on Logic Programming, Lecture Notes in Computer Science 2007, vol. 4670:45-75. Springer-Verlag.
25. M. Hanus, S. Antoy, B. Braßel, M. Engelke, K. Höppner, J. Koj, P. Niederau, R. Sadre, F. Steiner, PAKCS: The Portland Aachen Kiel Curry System. Available at 〈〉 (accessed on 2010-07-11), 2010. http://www.informatik.uni-kiel.de/~pakcs/.
26. Hanus M., Koschnicke S. An ER-based framework for declarative web programming. Proceedings of the 12th International Symposium on Practical Aspects of Declarative Languages, Lecture Notes in Computer Science 2010, vol. 5937:201-216. Springer-Verlag.
27. Hodas J.S., Miller D. Logic programming in a fragment of intuitionistic linear logic. Information and Computation 1994, 110(2):327-365.
28. Hutton G. Higher-order functions for parsing. Journal of Functional Programming 1992, 2(3):323-343.
29. Johnson R., Pearson D., Pingali K. The program structure tree: computing control regions in linear time. Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation 1994, 171-185. ACM Press.
30. S.C. Johnson, Yacc: yet another compiler compiler, Technical Report 32, Bell Laboratories, Murray Hill, New Jersey, 1975.
31. T. Kasami, An efficient recognition and syntax-analysis algorithm for context free languages, Scientific Report AF CRL-65-758, Air Force Cambridge Research Laboratory, 1965.
32. Knuth D.E. Semantics of context-free languages. Theory of Computing Systems 1968, 2(2):127-145.
33. Knuth D.E. Literate programming. The Computer Journal 1984, 27(2):97-111.
34. D. Leijen, E. Meijer, Parsec: direct style monadic parser combinators for the real world, Technical Report UU-CS-2001-27, Department of Computer Science, Universiteit Utrecht, 2001.
35. Lux W. Implementing encapsulated search for a lazy functional logic language. Proceedings of the Fourth Fuji International Symposium on Functional and Logic Programming, Lecture Notes in Computer Science 1999, vol. 1722:100-113. Springer-Verlag.
36. Marriott K. Constraint multiset grammars. Proceedings of the 1994 IEEE Symposium on Visual Languages 1994, 118-125. IEEE.
37. Matsuoka S., Takahashi S., Kamada T., Yonezawa A. A general framework for bidirectional translation between abstract and pictorial data. ACM Transactions on Information Systems 1992, 10(4):408-437.
38. Mazanek S., Maier S., Minas M. An algorithm for hypergraph completion according to hyperedge replacement grammars. Proceedings of the Fourth International Conference on Graph Transformations, Lecture Notes in Computer Science 2008, vol. 5214:39-53. Springer-Verlag.
39. Mazanek S., Maier S., Minas M. Auto-completion for diagram editors based on graph grammars. Proceedings of the 2008 IEEE Symposium on Visual Languages and Human-Centric Computing 2008, 242-245. IEEE.
40. Mazanek S., Minas M. Functional-logic graph parser combinators. Proceedings of the 19th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 2008, vol. 5117:261-275. Springer-Verlag.
41. S. Mazanek, M. Minas, Graph parser combinators: a challenge for Curry-compilers, in: M. Hanus, S. Fischer (Eds.), 25. Workshop der GI-Fachgruppe "Programmiersprachen und Rechenkonzepte", Christian-Albrechts-Universität zu Kiel, 2008, pp. 55-66, Technical Report 0811.
42. Mazanek S., Minas M. Business process models as a showcase for syntax-based assistance in diagram editors. Proceedings of the 12th International Conference on Model Driven Engineering Languages and Systems, Lecture Notes in Computer Science 2009, vol. 5795:322-336. Springer-Verlag.
43. S. Mazanek, M., Minas, Transforming BPMN to BPEL using parsing and attribute evaluation with respect to a hypergraph grammar, Accepted as a solution for the synthesis case of the GraBaTs 2009 tool contest, 2009.
44. Mendling J., Reijers H., van der Aalst W. Seven process modeling guidelines (7pmg). Information and Software Technology 2009, 52(2):127-136.
45. Minas M. Creating semantic representations of diagrams. Proceedings of the International Workshop on Applications of Graph Transformations with Industrial Relevance 2000, vol. 1779:209-224. Springer-Verlag.
46. Minas M. Hypergraphs as a uniform diagram representation model. Proceedings of the Sixth International Workshop on Theory and Application of Graph Transformations, Lecture Notes in Computer Science 2000, vol. 1764:281-295. Springer-Verlag.
47. Minas M. Concepts and realization of a diagram editor generator based on hypergraph transformation. Science of Computer Programming 2002, 44(2):157-180.
48. OASIS, Web Services Business Process Execution Language Version 2.0. (accessed on 2010-07-11). Actually, the transformation of this article does not generate BPEL 2.0 but still BPEL 1.1, 2007. http://docs.oasis-open.org/wsbpel/2.0/wsbpel-v2.0.pdf.
49. Object Management Group, Business Process Modeling Notation (BPMN). (accessed on 2010-07-11), 2009. http://www.omg.org/spec/BPMN/1.2/.
50. Ouyang C., Dumas M., Breutel S., ter Hofstede A. Translating standard process models to BPEL. Proceedings of the 18th International Conference on Advanced Information Systems Engineering, Lecture Notes in Computer Science 2006, vol. 4001:417-432. Springer-Verlag.
51. Ouyang C., Dumas M., ter Hofstede A., van der Aalst W. Pattern-based translation of BPMN process models to BPEL web services. International Journal of Web Services Research 2007, 5(1):42-62.
52. Peyton Jones S. Haskell 98, Language and Libraries, The Revised Report 2003, Cambridge University Press.
53. Pratt T.W. Pair grammars, graph languages and string-to-graph translations. Journal of Computer and System Sciences 1971, 5(6):560-595.
54. L.M. Rose, D.S. Kolovos, R.F. Paige, F.A. Polack, Model migration case for TTC 2010. (accessed on 2010-07-11), 2010. http://is.ieis.tue.nl/staff/pvgorp/events/TTC2010/cases/ttc2010_submission_2_v2010-04-22.pdf.
55. Schätz B. Formalization and rule-based transformation of EMF Ecore-based models. Proceedings of the First International Conference on Software Language Engineering, Lecture Notes in Computer Science 2009, vol. 5452:227-244. Springer-Verlag.
56. B. Schätz, UML model migration with PETE. (accessed on 2010-07-11), 2010. http://is.ieis.tue.nl/staff/pvgorp/events/TTC2010/submissions/final/pete.pdf.
57. Schürr A. Specification of graph translators with triple graph grammars. Proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 1994, vol. 903:151-163. Springer-Verlag.
58. Slagle J. Automated theorem-proving for theories with simplifiers, commutativity, and associativity. Journal of the ACM 1974, 21(4):622-642.
59. H. Störrle, A PROLOG-based approach to representing and querying software engineering models, in: Proceedings of the VLL 2007 Workshop on Visual Languages and Logic, vol. 274, CEUR Workshop Proceedings, CEUR-WS.org, 2007, pp. 71-83.
60. T. Strobl, M. Minas, Implementing an animated lambda-calculus, in: Proceedings of the Workshop on Visual Languages and Logic, CEUR Workshop Proceedings, vol. 510, CEUR-WS.org, 2009.
61. Swierstra S.D., Azero Alcocer P.R. Fast error correcting parser combinators: a short tutorial. Proceedings of the 26th Seminar on Current Trends in Theory and Practice of Informatics, Lecture Notes in Computer Science 1999, vol. 1725:111-129. Springer-Verlag.
62. Taentzer G., Biermann E., Bisztray D., Bohnet B., Boneva I., Boronat A., Geiger L., Geiß R., Horvath Á., Kniemeyer O., Mens T., Ness B., Plump D., Vajk T. Generation of Sierpinski triangles: a case study for graph transformation tools. Proceedings of the Third International Symposium on Applications of Graph Transformations with Industrial Relevance, Lecture Notes in Computer Science 2008, vol. 5088:514-539. Springer-Verlag.
63. Tanaka T. Definite-clause set grammars: a formalism for problem solving. Journal of Logic Programming 1991, 10(1):1-17.
64. Vanhatalo J., Völzer H., Koehler J. The refined process structure tree. Proceedings of the Sixth International Conference on Business Process Management, Lecture Notes in Computer Science 2008, vol. 5240:100-115. Springer-Verlag.
65. Wadler P. How to replace failure by a list of successes: a method for exception handling, backtracking, and pattern matching in lazy functional languages. Functional Programming Languages and Computer Architecture, Lecture Notes in Computer Science 1985, vol. 201:113-128. Springer-Verlag.
66. Wallace M. Partial parsing: combining choice with commitment. Proceedings of the 19th International Workshop on the Implementation and Application of Functional Languages, Lecture Notes in Computer Science 2008, vol. 5083:93-110. Springer-Verlag.
67. S. West, W. Kahl, A generic graph transformation, visualisation, and editing framework in Haskell, in: Proceedings of the Eighth International Workshop on Graph Transformation and Visual Modeling Techniques, vol. 18, Electronic Communications of the EASST, European Association of Software Science and Technology, 2009.