Service-oriented computing is dynamic. There may be many possible service instances available for binding, leading to uncertainty about where service requests will execute. We present a novel Markovian process calculus which allows the formal expression of uncertainty about binding as found in service-oriented computing. We show how to compute meaningful quantitative information about the quality of service provided in such a setting. These numerical results can be used to allow the expression of accurate service-level agreements about service-oriented computing. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Clark, A., Gilmore, S., & Tribastone, M. (2009). Service-level agreements for service-oriented computing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5486 LNCS, pp. 21–36). https://doi.org/10.1007/978-3-642-03429-9_3
Mendeley helps you to discover research relevant for your work.