Skip to main content
Conference ProceedingsOPEN ACCESS

Stochastic COWS

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4749 LNCS 245-256
DOI: 10.1007/978-3-540-74974-5_20
28Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A stochastic extension of COWS is presented. First the formalism is given an operational semantics leading to finitely branching transition systems. Then its syntax and semantics are enriched along the lines of Markovian extensions of process calculi. This allows addressing quantitative reasoning about the behaviour of the specified web services. For instance, a simple case study shows that services can be analyzed using the PRISM probabilistic model checker. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Prandi, D., & Quaglia, P. (2007). Stochastic COWS. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4749 LNCS, pp. 245–256). Springer Verlag. https://doi.org/10.1007/978-3-540-74974-5_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free