A probabilistic strategy language for probabilistic rewrite theories and its application to cloud computing

10Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Several formal models combine probabilistic and nondeterministic features. To allow their probabilistic simulation and statistical model checking by means of pseudo-random number sampling, all sources of nondeterminism must first be quantified. However, current tools offer limited flexibility for the user to define how the nondeterminism should be quantified. In this paper, we propose an expressive probabilistic strategy language that allows the user to define complex strategies for quantifying the nondeterminism in probabilistic rewrite theories. We have implemented PSMaude, a tool that extends Maude with a probabilistic simulator and a statistical model checker for our language. We illustrate the convenience of being able to define different probabilistic strategies on top of a system by a cloud computing example, where different load balancing policies can be specified by different probabilistic strategies. We then use PSMaude to analyze the QoS provided by different policies. © IFIP International Federation for Information Processing 2013.

Cite

CITATION STYLE

APA

Bentea, L., & Ölveczky, P. C. (2013). A probabilistic strategy language for probabilistic rewrite theories and its application to cloud computing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7841 LNCS, pp. 77–94). https://doi.org/10.1007/978-3-642-37635-1_5

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