TY  - CHAP
Y1  - 2009///
T3  - Lecture Notes in Computer Science
EP  - 36
AV  - none
N2  - 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.
SN  - 978-3-642-03429-9
ID  - eprints2567
SP  - 21
A1  - Clark, Allan
A1  - Gilmore, Stephen
A1  - Tribastone, Mirco
T2  - Recent Trends in Algebraic Development Techniques
TI  - Service-level agreements for service-oriented computing
PB  - Springer
UR  - http://dx.doi.org/10.1007/978-3-642-03429-9_3
N1  - 19th International Workshop, WADT 2008, Pisa, Italy, June 13-16, 2008, Revised Selected Papers
ER  -