5 research outputs found
A comparative study of process mediator components that support behavioral incompatibility
Most businesses these days use the web services technology as a medium to
allow interaction between a service provider and a service requestor. However,
both the service provider and the requestor would be unable to achieve their
business goals when there are miscommunications between their processes. This
research focuses on the process incompatibility between the web services and
the way to automatically resolve them by using a process mediator. This paper
presents an overview of the behavioral incompatibility between web services and
the overview of process mediation in order to resolve the complications faced
due to the incompatibility. Several state-of the-art approaches have been
selected and analyzed to understand the existing process mediation components.
This paper aims to provide a valuable gap analysis that identifies the
important research areas in process mediation that have yet to be fully
explored.Comment: 20 Pages, 9 figures and 8 Tables; International Journal on Web
Service Computing (IJWSC), September 2011, Volume 2, Number
Stability of Asynchronously Communicating Systems
Recent software is mostly constructed by reusing and composing existing components. Software components are usually stateful and therefore described using behavioral models such as finite state machines. Asynchronous communication is a classic interaction mechanism used for such software systems. However, analysing communicating systems interacting asynchronously via reliable FIFO buffers is an undecidable problem. A typical approach is to check whether the system is bounded, and if not, the corresponding state space can be made finite by limiting the presence of communication cycles in behavioral models or by fixing buffer sizes. In this paper, we focus on infinite systems and we do not restrict the system by imposing any arbitrary bounds. We introduce a notion of stability and prove that once the system is stable for a specific buffer bound, it remains stable whatever larger bounds are chosen for buffers. This enables us to check certain properties on the system for that bound and to ensure that the system will preserve them whatever larger bounds are used for buffers. We also prove that computing this bound is undecidable but show how we succeed in computing these bounds for many typical examples using heuristics and equivalence checking
Automated verification of automata communicating via FIFO and bag buffers
International audienceThis article presents new results for the automated verification of automata communicating asynchronously via FIFO or bag buffers. The analysis of such systems is possible by comparing bounded asynchronous compositions using equivalence checking. When the composition exhibits the same behavior for a specific buffer bound, the behavior remains the same for larger bounds. This enables one to check temporal properties on the system for that bound and this ensures that the system will preserve them whatever larger bounds are used for buffers. In this article, we present several decidability results and a semi-algorithm for this problem considering FIFO and bag buffers, respectively, as communication model. We also study various equivalence notions used for comparing the bounded asynchronous systems
Generating minimal protocol adaptors for loosely coupled services
In dynamic e-business, organizations collaborate in a just-in-time fashion using loosely coupled services. To ensure interoperability of the services, behavioral mismatches between their protocols need to be resolved in a fast and efficient way, which can be done with protocol adaptors. We present an efficient, automated method to construct (if possible) a minimal protocol adaptor with parallelism for two asynchronously communicating business protocols. A minimal adaptor only processes those messages that cause the mismatch, and has less message overhead at run-time than a non-minimal adaptor. Existing methods only build adaptors that are sequential, synchronous, or non-minimal. We show that the proposed method increases the efficiency of service adaption both at run-time and design-time