AutoSyn: A new approach to automated synthesis of composite web services with correctness guarantee

How to compose existing web services automatically and to guarantee the correctness of the design(e.g. freeness of deadlock and unspecified reception,and temporal constraints) is an important and challenging problem in web services. Most existing approaches require a detailed specification of the desired behaviors of a composite service beforehand and then perform certain formal verification to guarantee the correctness of the design,which makes the composition process both complex and time-consuming. In th...     

基于有限状态自动机的Web服务组合

Web服务是Web上的特殊软件资源,可以被应用系统发现和调用.如何根据用户的需求(目标服务)来组合Web服务是研究中需要解决的重要问题.通过使用有限状态自动机,服务组成的社区中的状态和操作可以使用有限状态自动机来模拟,这样可以表示服务操作的内部和外部概要.结合确定性动态命题逻辑,可以根据已有的Web服务,解决目标服务的可组合问题,产生组合计划.同时讨论了算法的复杂性.     

Reliability-aware automatic composition approach for web services

In this paper,we study the reliability-aware synthesis problem for composing available services automatically and guaranteeing that the composed result satisfies the specification,such as temporal constraints of functionality and reliability,centered on a synthesis model for mediator of web services composition (CSM).This approach focuses on handling attributes and state relations,and permitting users and services to operate over them,i.e.,read /write their data values and compare them according to a dense state order.We show that the reliability-aware synthesis problem for the specification is EXPTIME-complete and we give an exponential-time algorithm (CSM-NSA) which for a given formula ψ and a synthesis model,synthesizes available services in the library satisfying ψ over the synthesis model (if they exist) or responds with "not satisfiable" (otherwise).The specification ψ is a fragment of PCTL (probabilistic computation tree logic),obtained from "ordinary" CTL (computation tree logic) by replacing the EX,AX,EU and AU operation with their quantitative counterparts X >p,X =1,U >p,and U =1,respectively.As opposed to NSA,we provide a more effective algorithm to replace the NSA algorithm called CSM-HSA (heuristic synthesis algorithm).Though HSA is an incomplete algorithm,the answer is correct.The experiments show that the HSA algorithm solves the problem of reliability-aware service synthesis effectively and efficiently.     

Minimal privacy authorization in web services collaboration

With the popularity of Internet technology, web services are becoming the most promising paradigm for distributed computing. This increased use of web services has meant that more and more personal information of consumers is being shared with web service providers, leading to the need to guarantee that the private data of consumers are not illegitimate collected, used and disclosed in services collaboration. This paper studies how to realize the minimal privacy authorization while achieving the functional goals. Initially, this paper uses authorization policies to specify the privacy privileges of the services collaboration, and utilizes the trust relationships among services to make authorization decision. Next, it models the interface behaviors of services by extending the interface automata to support privacy semantics. Furthermore, it quantitatively analyzes the minimum set of privacy privileges which are required by the services to achieve the functional goals, and presents the minimal authorization algorithm, which helps us to automatically derive optimal authorization policies for a services collaboration. Finally, it verifies the correctness and efficiency of the approach proposed by this paper through a case study.     

A high performance backoff protocol for fast execution of composite web services

Using web services to expose applications over the Internet is now a widely accepted practice. Currently, there are several ongoing efforts that provide ways to effectively compose web services distributed across different organizations. One of the problems underlying the deployment of such composite services on the web, however, is service co-allocation that arises when a composite service needs to ensure all the required component services to be available for execution at the same time. Motivated by this, this paper presents a new decentralized protocol, named web service co-allocation protocol (WSCP), which can facilitate fast execution of composite web services. The proposed framework is an enhancement of the famous two phase commit protocol through the incorporation of tentative hold phase as well as the employment of a new high performance backoff protocol developed to better address the dynamics of the service co-allocation problem. The simulation results show that the proposed approach yields significant improvements over existing protocols.     

Meta web service: building web-based open decision support system based on web services

Web services are currently one of the trends in network-based business services, which intuitively will be applied to build a semantic web-based decision support system (DSS). Since web services are self-contained, modular business process applications, based on open standards, enable integration models for facilitating program-to-program interactions. Decision modules in a semantic web-based DSS can be viewed as a web service. However, according to the current features, web services know only about themselves, they are neither autonomous, nor are they designed to use ontologies; they are passive until invoked, and they do not provide for composing functionalities. These lead to the motivation on building a sophisticated web service to contain these features and to utilize web services on behalf of the user. This paper aims to propose a new concept of Meta Web Service, a web service-based DSS. The meta web service understands the user's problem statement with ontology, performs web service discovery, web service composition, and automatically generates codes for composite web service execution. Case-based reasoning is applied to quickly find past histories of successful service compositions. A prototype of research web service has been developed to show the feasibility of the proposed idea.     

一种基于UPPAAL的Web服务组合模型检测方法

Web服务组合的正确性验证对提高软件开发效率、实现服务增值具有重要意义。为从高层抽象层次研究Web服务组合的正确性及其形式化验证方法,考虑到Web服务组合中的实时特征,在采用软件体系结构描述语言XYG/ADL对Web服务组合进行描述的基础上,将其实时描述部分XYZ/RE转换至时间自动机模型,组合后系统应满足的性质用分支时序逻辑CTL公式表示,最后应用模型检测工具UPPAAL实现了Web服务组合正确性的自动化验证。     

Rigorous development of composite grid services

Cress (Communication Representation Employing Systematic Specification) is introduced as notation, a methodology and a toolset for service development. The article focuses on rigorous development of composite grid services, with particular emphasis on the principles behind the methodology. A straightforward graphical notation is used to describe grid services. These are then automatically specified, analysed and implemented. Analysis includes formal verification of desirable service properties, formal validation of test scenarios, testing of implementation functionality, and evaluation of implementation performance. The case study that illustrates the approach is document content analysis to compare two pieces of text. This involves two composite services supported by two partner services. The usability of the service design notation is assessed, and a comparison is made of the approach with similar ones. These show that the Cress approach to developing services is usable and more complete than other comparable approaches.     

Globally optimal selection of web composite services based on univariate marginal distribution algorithm

Quality of service (QoS) model of composite services and web service selection based on QoS are currently the hot issues in the web service composition area. Service selection based on QoS, which is a globally optimal selection issue, is a NP-hard problem. Taking engine into consideration, this paper develops a QoS model for service selection in the web composite services. We use the algorithm on the estimation of distribution to solve the NP-hard problem of service selection and present a web service selection method based on the univariate marginal distribution algorithm (UMDA). Simulation analysis and experimental study based on the UMDA method are carried out. It is proved that the method is effective in solving the NP-hard problem.     

基于有界限模型检验的服务建模与自动组合

针对面向服务架构(SOA)体系的Web服务数量快速增长现状,为实现大规模服务场景下高效自动组合Web服务来满足用户复杂需求问题,提出一种基于有界模型检验的Web服务组合方法.其中,Web服务被建模为有限状态自动机,众多Web服务构成服务社区,Web服务组合需求由线性时态逻辑公式描述,通过有界模型检验器的系统化搜索,该方...     

基于P2P的Web服务发现机制研究

在P2P系统中融入Web服务的相关技术,将传统的P2P系统转变为一种面向服务的架构是分布式计算发展的方向,而Web服务的自动发现是面向服务的架构要解决的关键问题之一.提出了一种基于P2P技术和语义Web的服务发现机制,将P2P系统作为服务的提供者整体接入Web服务,通过P2P网络实现服务描述信息的自动交换,并采用分段搜索机制处理用户查询,从而提高了用户查询的效率和准确性.     

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.     

Web服务的模型检测技术探讨

从模型检测的基本概念出发,针对目前面向服务计算模式中,组合Web服务验证确认过程存在的问题,着重讨论了模型检测应用于Web服务验证中的关键技术,例如如何验证动态绑定服务的可信性,如何克服服务组合过程中的复杂性和不确定性;比较全面地总结并比较了几种具有代表性的对Web服务进行验证和确认的模型检测技术和相关工具;并探讨了应用于Web服务验证框架的模型检测技术研究中存在的一些问题及相应的解决方案.     

Synthesis from hyperproperties

We study the reactive synthesis problem for hyperproperties given as formulas of the temporal logic HyperLTL. Hyperproperties generalize trace properties, i.e., sets of traces, to sets of sets of traces. Typical examples are information-flow policies like noninterference, which stipulate that no sensitive data must leak into the public domain. Such properties cannot be expressed in standard linear or branching-time temporal logics like LTL, CTL, or $$\hbox {CTL}^*$$. Furthermore, HyperLTL subsumes many classical extensions of the LTL realizability problem, including realizability under incomplete information, distributed synthesis, and fault-tolerant synthesis. We show that, while the synthesis problem is undecidable for full HyperLTL, it remains decidable for the $$\exists ^*$$, $$\exists ^*\forall ^1$$, and the $${{ linear }}\;\forall ^*$$ fragments. Beyond these fragments, the synthesis problem immediately becomes undecidable. For universal HyperLTL, we present a semi-decision procedure that constructs implementations and counterexamples up to a given bound. We report encouraging experimental results obtained with a prototype implementation on example specifications with hyperproperties like symmetric responses, secrecy, and information flow.     

Web Service Diagnoser Model for managing faults in web services

Reliability is an important criterion to facilitate extensive deployment of web service technology for commercial business applications. Run-time monitoring and fault management of web services are essential to ensure uninterrupted and continuous availability of web services. This paper presents WISDOM (Web Service Diagnoser Model) a generic architecture for detecting faults during execution of web services. Policies have been proposed to describe the intended behavior of web services and faulty behavior would be detected as deviations or inconsistencies with respect to the specified behavior. The model proposes the use of monitoring components in service registries and service providers to detect run-time faults during publishing, discovery, binding and execution of web services. An independent fault diagnoser is proposed to coordinate the individual monitoring components and also act as a repository for the specified web service policies. The proposed model has been tested with a sample web service application and the results obtained are presented.     

Coordinating multiple agents for workflow-oriented process orchestration

Distributed component-based services and semantic web services are promising technologies for next generation inter-enterprise integration. The dynamic nature of this domain presents a complex problem for tools that intend to support this cross-organizational integration. However, the autonomy and adaptation of software agents represent a viable solution for the composition and enactment of cross-organizational services. Currently, there are few studies that measure the impact of the dynamic environmental effects on service composition. On an on-going basis, composite services or workflow processes of web services may be constantly changing in terms of responsiveness of services, accessibility of services and their meta-information, business process schema changes, etc. These conditions impact what interactions a team of agents must undergo to achieve a specific process derived of composite web services. This paper describes an approach, model, and supporting software toward the efficient design of interaction protocols for coordinating agent teams in the business process orchestration domain. This approach considers several environmental conditions related to the dynamism of the Internet.