Wyniki wyszukiwania - BazTech

Ograniczanie wyników

3 Fundamenta Informaticae

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

A Net-based Approach to Web Services Publication and Replaceability

Bonchi F., Brogi A., Corfini S., Gadducci F.

Fundamenta Informaticae

2009

Vol. 94, nr 3/4

305-330

Web services represent a promising technology for the development of distributed heterogeneous software systems. In this setting, a major issue is to establish whether two services can be used interchangeably in any context. To this aim, our paper first briefly reviews the results contained in a recent article by the same authors, where a suitable notion of behavioural equivalence for Web services was introduced. Our work then extends those results, in order to account for ontologybased service specifications. Next, a concrete example scenario – a car rental system – is presented, and it is then used to illustrate how the equivalence between services can be fruitfully employed for correctly addressing two prominent, modularity-related problems: the publication of correct service specifications and the replaceability of (sub)services.

On the Use of Behavioural Equivalences for Web Services' Development

Bonchi F., Brogi A., Corfini S., Gadducci F.

Fundamenta Informaticae

2008

Vol. 89, nr 4

479-510

Web services are emerging as a promising technology for the development of next generation distributed heterogeneous software systems.We define a new behavioural equivalence for Web services, based on bisimilarity and inspired by recent advances in the theory of reactive systems. The equivalence is compositional and decidable, and it provides a firm ground for enhanced behaviouraware discovery and for a sound incremental development of services and service compositions.

Fully Abstract Semantics for a Coordination Model with Asynchronous Communication and Enhanced Matching

Brogi A., Jacquet J-M., Linden I.

Fundamenta Informaticae

2006

Vol. 73, nr 4

431-478

The paper proposes a theoretical study of a coordination language embodying Linda's asynchronous communication primitives with a refined matching mechanism based on pairs composed of attribute names associated with their values. Computations in this language are described by means of an operational semantics, reporting the whole traces of executions. The non-compositionality of this intuitive operational semantics motivates the design of a compositional and fully abstract denotational semantics.