An efficient algorithm for aggregating PEPA models

S. Gilmore, J. Hillston, M. Ribaudo

Research output: Contribution to journalArticlepeer-review


Performance Evaluation Process Algebra (PEPA) is a formal language for performance modeling based on process algebra. It has previously been shown that, by using the process algebra apparatus, compact performance models can be derived which retain the essential behavioral characteristics of the modeled system. However, no efficient algorithm for this derivation was given. We present an efficient algorithm which recognizes and takes advantage of symmetries within the model and avoids unnecessary computation. The algorithm is illustrated by a multiprocessor example
Original languageEnglish
Pages (from-to)449-464
Number of pages16
JournalIEEE Transactions on Software Engineering
Issue number5
Publication statusPublished - 1 May 2001


  • formal languages
  • multiprocessing systems
  • performance evaluation
  • process algebra
  • PEPA models
  • Performance Evaluation Process Algebra
  • formal language
  • model aggregation
  • multiprocessor
  • performance modeling
  • Algebra
  • Context modeling
  • Explosions
  • Formal languages
  • Partitioning algorithms
  • Performance analysis
  • Prototypes
  • State-space methods
  • Stochastic processes
  • Timing


Dive into the research topics of 'An efficient algorithm for aggregating PEPA models'. Together they form a unique fingerprint.

Cite this