Abstract. A fundamental promise of service oriented architecture (SOA) lies in the ease of integrating sharable information, processes, and other resources through interactions among the shared components that are modeled as web services. It is expected that not only the participating services are complex and have observable states, but the number of interacting services may be also large. Prior work on choreographies (conversation protocols) all focuses on specifying how the interacting web services should behave globally. Studies have shown that the relationships between global and local specifications of service interactions could be rather intricate. In this paper, we formulate a framework consisting of logical and implementation levels. We survey and discuss the technical problems and known results concerning service design, analysis and verification in this framework. 1

Service-oriented systems facilitate business workflows to span multiple organizations (e.g. by means of Web services). As a side effect, data may be more easily transferred over organizational boundaries. Thus, privacy issues arise. At the same time, there are personal, business and legal requirements for protecting privacy and IPR and allowing customers to request information about how and by whom their data was handled. Managing these requirements constitutes an unsolved technical and organizational problem. We propose to solve the information request problem by attaching meta-knowledge about how data was handled to the data itself. We present our solution, in form of an architecture, a formalization and an implemented prototype for logging and collecting logs in service-oriented and crossorganizational systems. 1.

Service Oriented Architectures draw heavily on techniques for reusing and assembling off-the-shelf software components. While powerful, this programming practice is not without a cost: the software architect must ensure that the off-the-shelf components interact safely and in ways that conform with the specification. We develop a new theory for adaptable service compositions. The theory provides an effective framework for analyzing the conformance of contract-based service compositions, and for enforcing their compliance, in a uniform, and formally elegant setting. 1.

Service-oriented systems facilitate business workflows to span multiple organizations (e.g. by means of Web services). As a side effect, data may be more easily transferred over organizational boundaries. Thus, privacy issues arise. At the same time, there are personal, business and legal requirements for protecting privacy and IPR and allowing customers to request information about how and by whom their data was handled. Managing these requirements constitutes an unsolved technical and organizational problem. We propose to solve the information request problem by attaching meta-knowledge about how data was handled to the data itself. We present our solution, in form of an architecture, a formalization and an implemented prototype for logging and collecting logs in service-oriented and cross-organizational systems. KEY WORDS: Web services, service-oriented architectures, distributed environments, provenance

This paper discusses the notion of protocol compatibility between Web services, and reviews a number of techniques for detecting incompatibilities and for synthesizing adapters for otherwise incompatible services. The paper also reviews related notions such as realizability, substitutability and controllability. 1

A challenging part of Software Testing entails the generation of test cases, which cost can be reduced by means of the use of techniques for automating this task. In this paper we present an approach based on the metaheuristic technique Scatter Search for the automatic test case generation of the BPEL business process. A transition coverage criterion is used as adequacy criterion. 1.

Abstract. In the dynamic e-Business environment, it is desirable for a service to meet the requirements of different users. The current available technologies rather supports a service with a single fixed business process without considering user needs. Such design makes it difficult for user to integrate the provided service, hence obstruct the service provider to expand the business. In this paper we proposed an alternative service design method- Adaptive Service Design. Inspired by the concept of Abstraction and Polymorphism in Object Oriented Computing, service adaptation allows an Abstract Business Process class to be configured by Policy and user required interface, hence dynamically generate multiple business processes to meet different user interaction requirements. Key words: service differentiation, service adaptation, matchmaking 1

Abstract: This article presents a mediation framework supporting the integration of web services in orchestrated and choreographed services and the conciliation of interaction protocol mismatches. Our framework supports a loosely-coupled interaction among web services, based on the publish and subscribe pattern. Moreover, it manages web services as event-driven systems, in order to enable them to perform their operations in context-dependent way. By decoupling the web service interaction, our framework addresses several interaction protocol mismatches, ranging from differences in the signatures of the messages, to the order and number of the messages to be exchanged, including cross-protocol mismatches involving more than two peers.

In service-oriented architectures (SOA), independently developed Web services can be dynamically composed. However, the composition is prone to producing semantically conflicting interactions among the services. For example, in an interdepartmental business collaboration through Web services, the decision by the marketing department to clear out the inventory might be inconsistent with the decision by the operations department to increase production. Resolving semantic conflicts is challenging especially when services are loosely coupled and their interactions are not carefully governed. To address this problem, we propose a novel distributed service choreography framework. We deploy safety constraints to prevent conflicting behavior and enforce reliable and efficient service interactions via federated publish/subscribe messaging, along with strategic placement of distributed choreography agents and coordinators to minimize runtime overhead. Experimental results show that our framework prevents semantic conflicts with negligible overhead and scales better than a centralized approach by up to

Abstract—Process mining facilitates the analysis of business processes by extracting a process model from event logs. Most mining algorithms perform well on single-system event logs that explicitly refer to a process instance or case. However, in many operational environments such case identifiers are not directly recorded. In supply chain processes there are even further challenges, since different identification numbers and numerous aggregation steps prevent individual work items to become traceable as a case. In this paper, we investigate how the EPCglobal standard for processing Radio Frequency Identification (RFID) events can make supply chain data accessible for process mining. Our contribution is an algorithm that is able to deal with challenges of case identification and focus shifts. We present a prototypical implementation and use a process based on the Supply Chain Operations Reference (SCOR) Model to evaluate our implementation. Keywords-RFID; EPCglobal; process mining; supply chain I.