Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Testing preorders for probabilistic processes
Information and Computation
Performance measure sensitive congruences for Markovian process algebras
Theoretical Computer Science
Discrete time generative-reactive probabilistic processes with different advancing speeds
Theoretical Computer Science
A model for web services discovery with QoS
ACM SIGecom Exchanges
Subtyping for session types in the pi calculus
Acta Informatica
A theory of contracts for web services
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A survey on web services composition
International Journal of Web and Grid Services
A formal account of contracts for web services
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
| Hi-index | 0.00 |
The behavior of aWeb service can be described by means of a contract, which is a specification of the legal interactions with the service. Given a repository of Web services, from the client viewpoint a proper service selection should be based on functional as well as nonfunctional aspects of the interactions. In this paper we provide a technique that enables a client both to discover compatible services and to compare them on the basis of specific performance requirements. Our technique, which is illustrated on a simple probabilistic calculus, relies on two families of client-specific probabilistic testing preorders. These are shown to be precongruences with respect to the operators of the language and not to collapse into equivalences unlike some more general probabilistic testing preorders appeared in the literature.