Formal techniques for performance analysis: blending SAN and PEPA

  • Authors:
  • Jane Hillston;Leïla Kloul

  • Affiliations:
  • University of Edinburgh, Laboratory for Foundations of Computer Science, School of Informatics, EH9 3JZ, Edinburgh, UK;Université de Versailles, PRiSM, 45, Avenue des Etats-Unis, 78035, Versailles Cedex, France

  • Venue:
  • Formal Aspects of Computing
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

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.