Formal techniques for performance analysis: Blending SAN and PEPA

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

Abstract

In this paper we consider two performance modelling techniques from the perspectives of model construction, generation of an underlying continuous time Markov process, and the potential for reduction in the Markov process. Such careful comparison of modelling techniques allows us to appreciate the strengths and weaknesses of different approaches, and facilitates cross-fertilization between them. In the present case we take a characteristic of one formalism, functional rates in Stochastic Automata Networks, and introduce it to the other formalism, Performance Evaluation Process Algebra. We investigate the benefits of this cross-fertilization, particularly from the perspectives of Markov process generation and reduction. © British Computer Society 2007.

Cite

CITATION STYLE

APA

Hillston, J., & Kloul, L. (2007). Formal techniques for performance analysis: Blending SAN and PEPA. Formal Aspects of Computing, 19(1), 3–33. https://doi.org/10.1007/s00165-006-0011-6

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