Soundness-preserving refinements of service compositions

Soundness is one of the well-studied properties of processes; it denotes that a final state can be reached from every state that is reachable from the initial state. Soundness-preserving refinements are important for enabling the compositional design of systems. In this paper we concentrate on refinements of service compositions. We model service compositions using Petri nets, and consider specific pairs of places that belong to different services. Starting from a sound service composition, we show how to check whether such a pair of places can be refined by another sound service composition, so that soundness is preserved through the refinement

Relating fair testing and accordance for service replaceability

AbstractThe accordance pre-order describes whether a service can safely be replaced by another service. That is, all partners for the original service should be partners for the new service. Partners for a service interact with the service in such a way that always a certain common goal can be reached.We relate the accordance pre-order to the pre-orders known from the linear–branching time spectrum, notably fair testing. The differences between accordance and fair testing include the modeling of termination and success, and the parts of the services that cannot be used reliably by any partner. Apart from the theoretical results, we address the practical relevance of the introduced concepts

Proof techniques for adapter generation

We study the composition and substitution of services from a theoretical perspective. An important notion is the operating guideline of a service y, which is defined as the set of services x such that the result of connecting x and y has a certain desired property. We define several related notions and derive results for them in a general context, thus abstracting from the underlying formalism, be it process algebra, Petri nets or something else. We then focus on the open Petri-net (and oWFN) formalism, and address the automated generation of adapters

Proof techniques for adapter generation

We study the composition and substitution of services from a theoretical perspective. An important notion is the operating guideline of a service y, which is defined as the set of services x such that the result of connecting x and y has a certain desired property. We define several related notions and derive results for them in a general context, thus abstracting from the underlying formalism, be it process algebra, Petri nets or something else. We then focus on the open Petri-net (and oWFN) formalism, and address the automated generation of adapters