Conference Paper

A Priori Conformance Verification for Guaranteeing Interoperability in Open Environments.

DOI: 10.1007/11948148_28 Conference: Service-Oriented Computing - ICSOC 2006, 4th International Conference, Chicago, IL, USA, December 4-7, 2006, Proceedings
Source: DBLP

ABSTRACT An important issue, in open environments like the web, is guarantee- ing the interoperability of a set of services. When the interaction scheme that the services should follow is given (e.g. as a choreography or as an interaction proto- col), it becomes possible to verify, before the interaction takes place, if the inter- active behavior of a service (e.g. a BPEL process specification) respects it. This verification is known as "conformance test". Recently some attempts have been done for defining conformance tests w.r.t. a protocol but these approaches fail in capturing the very nature of interoperability, turning out to be too restrictive. In this work we give a representation of protocol, based on message exchange and on finite state automata, and we focus on those properties that are essential to the verification of the interoperability of a set of services. In particular, we define a conformance test that can guarantee, a priori, the interoperability of a set of services by verifying properties of the single service against the protocol. This is particularly relevant in open environments, where services are identified and composed on demand and dynamically, and the system as a whole cannot be analyzed.

  • [Show abstract] [Hide abstract]
    ABSTRACT: Previous research into Web service selection mainly uses an orchestration model, in which a single entity is responsible for the selection and invocation of various Web services. However in many application scenarios, each Web service independently performs a selection, even though achieving the business's goals demands collective, pairwise interactions across the total set of Web services. This study instead considers the Web service selection problem in a choreographed environment, in which each Web service maintains its confidentiality about its collaborators and exchanges only limited amounts of information with its partners. The goal is to maximize the likelihood of completing the entire choreography in a failure-prone environment. Several experiments show that the proposed method performs similarly to a centralized method and better than three distributed Web service selection methods that involve various degrees of information about other services.
    Decision Support Systems 02/2013; 54(3):1463–1476. DOI:10.1016/j.dss.2012.12.017 · 2.04 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: The paper deals with the problem of agents conformance with multiparty protocols. We introduce a notion of conformance of a set of k agents with a multiparty protocol with k roles, which requires the agents to be interoperable and to produce correct executions of the protocol. We introduce conditions that enable each agent to be independently verified with respect to the protocol. We assume that protocols are specified in a temporal action theory and we show that the problem of verifying the conformance of an agent with a protocol can be solved by making use of automata based techniques. Protocols with nonterminating computations, modeling reactive agents, can also be captured in this framework.
    Computational Logic in Multi-Agent Systems; 07/2009
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The paper addresses the problem of agents compatibility and their conformance to protocols. We assume that the specification of pro-tocols is given in an action theory by means of temporal constraints and, in particular, communicative actions are defined in terms of their effects and preconditions on the social state of the protocol. In this framework, we can deal both with terminating and infinite protocols (reactive ser-vices). We show that the problem of verifying the conformance of an agent with a protocol can be solved by making use of an automata based approach, and that the conformance of a set of agents with a protocol guarantees that their interaction cannot produce deadlock situations and it only gives rise to runs of the protocol.