Approximate model checking of stochastic COWS

3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Given the description of a model and a probabilistic formula, approximate model checking is a verification technique based on statistical reasoning that allows answering whether or not the model satisfies the formula. Only a subset of the properties that can be analyzed by exact model checking can be attacked by approximate methods. These latest methods, though, being based on simulation and sampling have the advantage of not requiring the generation of the complete state-space of the model. Here we describe an efficient tool for the approximate model checking of services written in a stochastic variant of COWS, a process calculus for the orchestration of services. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Quaglia, P., & Schivo, S. (2010). Approximate model checking of stochastic COWS. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6084 LNCS, pp. 335–347). https://doi.org/10.1007/978-3-642-15640-3_22

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