Development of Web-Telecom based hybrid services orchestration and execution middleware over convergence networks

Influenced by the success of Web service technologies for development and deployment of IT services, Telecom R&D community starts to adapt and build similar service delivery platforms, trying to manage the hard constraints in Telecom domains, such as existence of heterogeneous protocols, extensive use of asynchronous communications and real-time delivery requirements, which will open a new paradigm for Web service based voice over IP communication and also can be easily integrated in end-to-end SOA solutions. In this paper, we study both the Web-Telecom based hybrid services orchestration and execution middleware for coordinating existing Telecom services and IT services. In particular, we focus on the design and implementation Web-Telecom based hybrid service bus (WTSB), event-driven Telecom service engine (EDLE) and also the integration layer for the messages dispatching and transformation between WTSB and EDLE, which can make the EDLE service engine seamlessly integrated into WTSB. More specifically, with multimedia conferencing scenarios, we demonstrate how our hybrid services orchestration and execution middleware orchestrate multimedia conferencing communication services together, and also make performance measurement and analysis. Finally, we give the conclusions and future work.     

有色Petri网协作模型的BPEL代码实现

Web服务业务流程执行语言（BPEL）提供了有力的技术来聚合封装的功能以及定义高质量的Web服务,然而,尽管功能强大,但是BPEL却难于使用。另一方面,有色Petri（CPNs）可以用于模拟、分析以及校验Web服务。为了在CPNs协作模型和业务流程的执行之间建立一座桥梁,给出了基于CPNs从过程模型驱动演绎出一致的BPEL代码的方法。首先,把CPNs协作模型转换为结构工作流网模型;然后,把工作流网模转换为BPEL代码,最后,通过电话机故障修理的案例研究,说明了算法的有效性。     

着色Petri网模型检测工具的扩展及其在Web服务组合中的应用

Web服务组合的形式化描述和验证是一个重要的研究问题.为了更好地完成验证工作,提出了扩展着色Petri网的模型检测方法.首先,在着色Petri网原有的基于CTL的局部模型检测算法基础上,给出了获取模型检测证据/反例的算法,并在着色Petri网模型检测工具--CPN Tools--中使用ML(meta language)语言实现了这些算法,然后将扩展后的CPN模型检测工具应用在Web服务组合的验证问题中.该方法不仅可以验证Web服务组合是否存在逻辑错误,还能告诉用户发生错误的原因,为Web服务组合的验证提供了技术上的保障.实验表明对着色Petri网的模型检测工具的扩展是正确、有效的.     

基于Petri网的Web服务BPEL4WS建模与分析

描述了Web服务业务流程执行语言(BPEL4WS或BPEL)的Petri网建模方法，利用网结构描述基于Web服务业务流程的行为特性。在对BPEL4WS的结构性活动和故障补偿处理机制进行逐层分析的基础上，提出了一个利用Petri网的逐步求精技术对流程进行建模的算法。然后结合具体实例阐述了利用该算法建模的详细过程，并对所生成的Petri网模型进行了完整性（soundness)验证     

XrML-RBLicensing approach adapted to the BPEL process of composite web services

Web service orchestration represents an open and standards-based approach for connecting web services together leading to higher level of business processes. Business Process Execution Language (BPEL) engines are designed to handle this orchestration. However, web service compositions into BPEL suffer from several non-functional requirements such as security. To address this problem, we propose in this paper a novel approach that is based on a harmony between the licensing concept offered by eXtensible rights Markup Language (XrML), aspect-oriented programming (AOP), and web service compositions in BPEL. Our proposed approach, based on XrML, offers the ability to associate security licenses with activities offered by the composite web services. It allows to automatically generate BPEL aspects depending on the developed licenses, to separate between crosscutting concerns of the composed web services, and provides an easy way to include and update the non-functional requirements (e.g., security) into a BPEL process. It offers also the ability to validate the licenses, at runtime and without affecting the business logic of this model. To evaluate our approach, we have developed an inventory control system (ICS) sample that is composed of several web services. Case study and performance analysis are presented to demonstrate its feasibility as well.     

应用Petri网改进BPEL程序的正确性*

为了解决BPEL组合服务的正确性保证问题,提出一种基于Petri 网改善组合服务的正确性的集成方法。提出将BPEL程序转换成由PNML表示的Petri网的规则,实现由BPEL程序转换成Petri网和基于Petri网导出变迁触发序列的算法,借助一个开源工具PIPE2可分析与评价组合服务的正确性、活性等属性,所导出的触发序列可生成BPEL程序的单元测试的测试序列。案例研究表明,此方法有助于保证BPEL程序的正确性。     

Fuzzy rule base systems verification using high-level Petri nets

In this paper, we propose a Petri nets formalism for the verification of rule-based systems. Typical structural errors in a rule-based system are redundancy, inconsistency, incompleteness, and circularity. Since our verification is based on Petri nets and their incidence matrix, we need to transform rules into a Petri nets first, then derive an incidence matrix from the net. In order to let fuzzy rule-based systems detect above the structural errors, we are presenting a Petri-nets-based mechanism. This mechanism consists of three phases: rule normalization, rules transformation, and rule verification. Rules will be first normalized into Horn clauses, then transform the normalized rules into a high-level Petri net, and finally we verify these normalized rules. In addition, we are presenting our approach to simulate the truth conditions which still hold after a transition firing and negation in Petri nets for rule base modeling. In this paper, we refer to fuzzy rules as the rules with certainty factors, the degree of truth is computed in an algebraic form based on state equation which can be implemented in matrix computation in Petri nets. Therefore, the fuzzy reasoning problems can be transformed as the liner equation problems that can be solved in parallel. We have implemented a Petri nets tool to realize the mechanism presented fuzzy rules in this paper.     

A modelling approach to Service oriented Architecture for on-line diagnosis

Failure diagnosis is one of the key challenges of Service oriented Architectures. One of the methods of identifying occurrences of failure is to use Diagnosers; software modules or services are deployed with the system to monitor the interaction between services for identifying whether a failure has happened or may have happened. This paper aims to present a suitable modelling framework to allow automated creation of Diagnosers based on Discrete Event System (DES) theory. Coming up with an appropriate modelling language framework is a prerequisite to applying DES techniques. Modelling languages popular in DES, such as Petri nets and automata, despite being sufficiently adequate for modelling, are not well adopted by the SoA community. Inspired by Petri nets and Workflow Graph, the modelling suggested in this paper closely follows BPEL that is widely used by the community. In particular, our language includes constructs that are supported by major tool vendors. To demonstrate that the suggested formal language is a suitable basis for the application of DES theory, we have extended one of the existing DES methods for the creation of centralised Diagnoser. Two algorithms for creating Diagnosers are put forward. These algorithms are applied into the models that are abstracted from the BPEL representation of the involving services. As a proof of concept, an implementation of the suggested approach is created as an Oracle JDeveloper plugin that automatically produces new Diagnosing services and integrates them to work with existing services. The paper ends with a series of empirical results on the performance-related aspects of the proposed method.     

A Calculus for Generation, Verification and Refinement of BPEL Specifications

Business Process Execution Language for Web Services (WS-BPEL) is the emerging standard for designing Web Services compositions. In this context, formal methods can contribute to increased reliability and consistency in the BPEL design process. In this paper we propose an approach based on the HAL Toolkit that allows verification of the correctness of the behavior of a π-based specification of interacting Web Services, and generates the BPEL processes that have the same behavior. This correlation based on two-way mapping between the π-based orchestration calculus and BPEL. This approach facilitates the verification and refinement process and may be applied to any BPEL implementation.     

Web服务组合在水利领域中的应用

随着水利信息化的发展,如何实现不断增加的异构系统的应用集成成为一个新的研究课题。而使用基于模型驱动架构MDA的Web服务组合技术,能够更好地实现水利领域的应用集成。按照MDA方法,给出了使用Petri网来建立Web服务组合的模式,以及组合模型正确性验证的方法,并提出了将Petri网模型影射到可执行的BPEL4WS的方法。通过一个实例,说明了基于MDA的Web服务组合技术在水利领域应用集成中的作用。最后进行了总结,指出了下一步工作。     

Translating unstructured workflow processes to readable BPEL: Theory and implementation

The Business Process Execution Language for Web Services (BPEL) has emerged as the de facto standard for implementing processes. Although intended as a language for connecting web services, its application is not limited to cross-organizational processes. It is expected that in the near future a wide variety of process-aware information systems will be realized using BPEL. While being a powerful language, BPEL is difficult to use. Its XML representation is very verbose and only readable for the trained eye. It offers many constructs and typically things can be implemented in many ways, e.g., using links and the flow construct or using sequences and switches. As a result only experienced users are able to select the right construct. Several vendors offer a graphical interface that generates BPEL code. However, the graphical representations are a direct reflection of the BPEL code and not easy to use by end-users. Therefore, we provide a mapping from Workflow Nets (WF-nets) to BPEL. This mapping builds on the rich theory of Petri nets and can also be used to map other languages (e.g., UML, EPC, BPMN, etc.) onto BPEL. In addition to this we have implemented the algorithm in a tool called WorkflowNet2BPEL4WS.     

Grid Service Orchestration Using the Business Process Execution Language (BPEL)

Modern scientific applications often need to be distributed across Grids. Increasingly applications rely on services, such as job submission, data transfer or data portal services. We refer to such services as Grid services. While the invocation of Grid services could be hard coded in theory, scientific users want to orchestrate service invocations more flexibly. In enterprise applications, the orchestration of web services is achieved using emerging orchestration standards, most notably the Business Process Execution Language (BPEL). We describe our experience in orchestrating scientific workflows using BPEL. We have gained this experience during an extensive case study that orchestrates Grid services for the automation of a polymorph prediction application. Using this example, we explain the extent with which the BPEL language supports the definition of scientific workflows. We then describe the reliability, performance and scalability that can be achieved by executing a complex scientific workflow with ActiveBPEL, an industrial strength but freely available BPEL engine. *The work has been funded by the UK EPSRC through grants GR/R97207/01 (e-Materials) and GR/S90843/01 (OMII Managed Programme).     

ITL semantics of composite Petri nets

interval temporal logic (itl) and Petri nets are two well developed formalisms for the specification and analysis of concurrent systems. itl allows one to specify both the system design and correctness requirements within the same logic based on intervals (sequences of states). As a result, verification of system properties can be carried out by checking that the formula describing a system implies the formula describing a requirement. Petri nets, on the other hand, have action and local state based semantics which allows for a direct expression of causality aspects in system behaviour. As a result, verification of system properties can be carried out using partial order reductions or invariant based techniques. In this paper, we investigate a basic semantical link between temporal logics and compositionally defined Petri nets. In particular, we aim at providing a support for the verification of behavioural properties of Petri nets using methods and techniques developed for itl.     

基于Petri网的服务组合故障诊断与处理

通过分析服务组合的故障需求,给出服务组合故障处理的框架.该框架采用Petri网来解决服务组合的错误发现及其处理问题.重点讨论了可用服务失败、组件失败及网络故障的情况,并相应地给出了服务组合故障模型.在此基础上对故障处理模型进行分析,给出服务组合故障处理正确性准则,并证明了其正确性.最后,采用CTL (computational tree logic)描述相关性质并提出验证服务组合故障分析的实施算法.仿真结果表明,该方法在处理服务组合故障时具有一定的优越性.     

基于服务元网络体系结构的滑动窗口改进算法

针对TCP/IP网络存在的层间功能重叠、层次固定难于扩展和服务质量等方面存在的问题,服务元网络体系结构提供了一个高效简洁的解决之道[1]。服务元网络体系结构是一种非层次的网络体系结构,采用端到端的虚电路作为数据传输方式。针对这种独特的网络体系结构,提出了一种基于自适应延迟确认的滑动窗口协议改进算法,并使用着色Petri网验证了该算法的正确性、完备性和可行性。     

面向服务架构的流程状态保存与恢复方法

以业务流程执行语言(BPEL)为基础,选取无状态的Web服务,采用有色Petri网模型描述业务流程,设计一种多输入多输出、引擎集中式的流程执行结构,使用关联矩阵和消息的双向传递实现应用级的状态保存。当流程异常中断时,提供恢复执行所需的最小状态集合,保证基于Web服务BPEL的面向服务架构应用的正确性和连续性。实例分析表明,该方法实用性强、可靠性高。     

Verification of causal models using petri nets

Many different approaches, mainly based on logical formalisms, have been proposed for modeling causal knowledge and the inferential mechanisms based on this type of knowledge. In this article we present an alternative approach to this problem in which the semantics of a causal model is provided by adopting Petri nets. We show how this scheme of modeling is powerful enough to capture all crucial aspects of the corresponding causal model, without resorting to very complex structures; indeed, the model is obtained using a particular type of deterministic Petri net. Moreover, a complete formalization of the aspects concerning the correctness of the represented causal model is provided in terms of reachability in the Petri net. We believe that this aspect is very important in the knowledge acquisition phase when precise correctness criteria should be defined and respected in the construction of the model. We analyze some of these criteria and we discuss an algorithm (based on a backward simulation of the net) capable of discovering incorrectness by exploiting analysis tools available for Petri nets and the explicit parallelism of the model. © 1992 John Wiley & Sons, Inc.     

Two theoretical and practical aspects of knitting technique:invariants and a new class of Petri net

We present two aspects of knitting technique, the structural properties (especially the P- and T-invariants), and the synchronized choice net (a new class of Petri net), that are of both theoretical importance and practical uses to the verification of structural correctness of a Petri net or to detect the structural problem of a Petri net. This work first proves that the ordinary Petri nets synthesized with knitting technique are structurally bounded, consistent, conservative and safe (when each home place holds one token) using the well-known linear algebra approach. It also provides a procedure for finding P- and T-invariants for Petri net synthesized using the knitting technique. We present examples for P-invariants and show that we can synthesize Petri nets more general than the "asymmetric-choice nets". The algorithm for finding P-invariants of ordinary Petri nets is extended to find the P-invariants for a general Petri net synthesized with knitting technique and the arc-ratio rules. We present a new class of Petri nets, called synchronized choice nets, which are the largest set of Petri nets that can be covered by both T-components and P-components. An algorithm is proposed to find its T-components and the P-components, respectively. The complexity of this algorithm is also presented. The theory of synchronized choice nets has the potential to simplify that for free choice nets.