Performance-Oriented Comparison of Web Services Via Client-Specific Testing Preorders

  • Marco Bernardo
  • Luca Padovani
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4468)


The behavior of a Web 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 non-functional 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.


Generative Weight Service Contract Passive Action Current Derivative Uddi Registry 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Banerji, A., Bartolini, C., Beringer, D., Chopella, V.: et al.: Web Services Conversation Language (wscl) 1.0 (2002),
  2. 2.
    Beringer, D., Kuno, H., Lemon, M.: Using wscl in a uddi Registry 1.0, UDDI Working Draft Best Practices Document (2001),
  3. 3.
    Bernardo, M., Bravetti, M.: Performance Measure Sensitive Congruences for Markovian Process Algebras. Theoretical Computer Science 290, 117–160 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Bernardo, M., Cleaveland, R.: A Theory of Testing for Markovian Processes. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 305–319. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  5. 5.
    Booth, D., Liu, C.K.: Web Services Description Language wsdl Version 2.0 Part 0: Primer (2006),
  6. 6.
    Bravetti, M., Aldini, A.: Discrete Time Generative-Reactive Probabilistic Processes with Different Advancing Speeds. Theoretical Computer Science 290, 355–406 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Carpineti, S., Castagna, G., Laneve, C., Padovani, L.: A Formal Account of Contracts for Web Services. In: Bravetti, M., Núñez, M., Zavattaro, G. (eds.) WS-FM 2006. LNCS, vol. 4184, pp. 148–162. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  8. 8.
    Castagna, G., Gesbert, N., Padovani, L.: A Theory of Contracts for Web Services. In: PLAN-X 2007. Proc. of the 5th ACM SIGPLAN Workshop on Programming Language Technologies for XML, pp. 37–49. ACM Press, New York (2007)Google Scholar
  9. 9.
    Chinnici, R., Haas, H., Lewis, A.A., Moreau, J.-J., et al.: Web Services Description Language (wsdl) Version 2.0 Part 2: Adjuncts (2006),
  10. 10.
    Chinnici, R., Moreau, J.-J., Ryman, A., Weerawarana, S.: Web Services Description Language (wsdl) Version 2.0 Part 1: Core Language (2006),
  11. 11.
    Christensen, E., Curbera, F., Meredith, G., Weerawarana, S.: Web Services Description Language (wsdl) 1.1 (2001),
  12. 12.
    Cleaveland, R., Dayar, Z., Smolka, S.A., Yuen, S.: Testing Preorders for Probabilistic Processes. Information and Computation 154, 93–148 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Colgrave, J., Januszewski, K.: Using wsdl in a uddi Registry, technical note (2004),
  14. 14.
    de Nicola, R., Hennessy, M.: Testing Equivalences for Processes. in Theoretical Computer Science 34, 83–133 (1983)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Dustdar, S., Schreiner, W.: A Survey on Web Services Composition. International Journal of Web and Grid Services 1, 1–30 (2005)CrossRefGoogle Scholar
  16. 16.
    Gay, S., Hole, M.: Subtyping for Session Types in the π-calculus. Acta Informatica 42, 191–225 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Van Glabbeek, R.J., Smolka, S.A., Steffen, B.: Reactive, Generative and Stratified Models of Probabilistic Processes. Information and Computation 121, 59–80 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Ran, S.: A Model for Web Services Discovery with QoS. ACM SIGecom Exchanges 4, 1–10 (2003)CrossRefGoogle Scholar
  19. 19.
    Stewart, W.J.: Introduction to the Numerical Solution of Markov Chains. Princeton University Press, Princeton (1994)zbMATHGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2007

Authors and Affiliations

  • Marco Bernardo
    • 1
  • Luca Padovani
    • 1
  1. 1.Università di Urbino – Italy, Istituto di Scienze e Tecnologie dell’InformazioneItaly

Personalised recommendations