首页> 外文期刊>IBM Systems Journal >Declarative techniques for model-driven business process integration
【24h】

Declarative techniques for model-driven business process integration

机译:模型驱动的业务流程集成的声明技术

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

Business process integration and automation are among the most significant factors driving the information technology industry today. In addressing the manifold technology challenges of integration and automation, new standardization efforts aim at improving the interoperability of businesses by moving toward a declarative specification of business processes, that is, one which describes what a business process does and not how it is implemented. At the same time, Model Driven Architecture~® focuses on improving the software-engineering methods with which business process solutions are implemented by separating the business or application logic from the underlying platform technology and representing this logic with precise semantic models. In this paper, we present an approach to the model-driven generation of programs in the Business Process Execution Language for Web Services (BPEL4WS), which transforms a graphically represented control-flow model into executable code by using techniques that originated in compiler theory. We discuss the underlying algorithms as well as general questions concerning the representation and analysis of model transformations. We study a declarative representation of transformation rules, where preconditions and postconditions are represented in the Object Constraint Language. By adopting a declarative approach, we pave the way for future automatic consistency checking of transformation rules and bidirectional reconciliation of evolving models.
机译:业务流程集成和自动化是当今推动信息技术行业发展的最重要因素。在解决集成和自动化的多种技术挑战时,新的标准化工作旨在通过朝着声明性的业务流程规范(即描述业务流程的功能而不是业务流程的方式)的方向改进业务的互操作性。同时,Model Driven Architecture〜®致力于通过将业务或应用程序逻辑与底层平台技术分离并用精确的语义模型表示该逻辑,来改进用于实施业务流程解决方案的软件工程方法。在本文中,我们提出了一种用于Web服务的业务流程执行语言(BPEL4WS)中的模型驱动程序生成方法,该方法通过使用源自编译器理论的技术将图形化表示的控制流模型转换为可执行代码。我们讨论了基础算法以及有关模型转换表示和分析的一般问题。我们研究转换规则的声明性表示,其中前提条件和后置条件以对象约束语言表示。通过采用声明性方法,我们为将来的转换规则自动一致性检查和演化模型的双向对帐铺平了道路。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号