Uma máquina de redução de grafos extensível para a implementação de fluxos de trabalho
Graph Reduction Machines, are a traditional technique for implementing functional programming languages. They allow to run programs by transforming graphs by the successive application of reduction rules. Web service composition enables the creation of new web services from existing ones. BPEL is...
Na minha lista:
Autor principal: | |
---|---|
Outros Autores: | |
Formato: | Dissertação |
Idioma: | por |
Publicado em: |
Universidade Federal do Rio Grande do Norte
|
Assuntos: | |
Endereço do item: | https://repositorio.ufrn.br/jspui/handle/123456789/19822 |
Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|
Resumo: | Graph Reduction Machines, are a traditional technique for implementing functional programming
languages. They allow to run programs by transforming graphs by the successive
application of reduction rules. Web service composition enables the creation of
new web services from existing ones. BPEL is a workflow-based language for creating
web service compositions. It is also the industrial and academic standard for this kind of
languages. As it is designed to compose web services, the use of BPEL in a scenario where
multiple technologies need to be used is problematic: when operations other than web
services need to be performed to implement the business logic of a company, part of the
work is done on an ad hoc basis. To allow heterogeneous operations to be part of the same
workflow, may help to improve the implementation of business processes in a principled
way. This work uses a simple variation of the BPEL language for creating compositions
containing not only web service operations but also big data tasks or user-defined operations.
We define an extensible graph reduction machine that allows the evaluation of BPEL
programs and implement this machine as proof of concept. We present some experimental
results. |
---|