An efficient algorithm for aggregating PEPA models

S. Gilmore; J. Hillston; M. Ribaudo

doi:10.1109/32.922715

An efficient algorithm for aggregating PEPA models

Research output: Contribution to journal › Article › peer-review

Abstract / Description of output

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 language	English
Pages (from-to)	449-464
Number of pages	16
Journal	IEEE Transactions on Software Engineering
Volume	27
Issue number	5
DOIs	https://doi.org/10.1109/32.922715
Publication status	Published - 1 May 2001

Keywords / Materials (for Non-textual outputs)

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

Access to Document

10.1109/32.922715

canonicalAccepted author manuscript, 466 KB

http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=922715

Cite this

@article{8b45568e84974207b282cd74ce3d3c6e,

title = "An efficient algorithm for aggregating PEPA models",

abstract = "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",

keywords = "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",

author = "S. Gilmore and J. Hillston and M. Ribaudo",

year = "2001",

month = may,

day = "1",

doi = "10.1109/32.922715",

language = "English",

volume = "27",

pages = "449--464",

journal = "IEEE Transactions on Software Engineering",

issn = "0098-5589",

publisher = "Institute of Electrical and Electronics Engineers",

number = "5",

}

TY - JOUR

T1 - An efficient algorithm for aggregating PEPA models

AU - Gilmore, S.

AU - Hillston, J.

AU - Ribaudo, M.

PY - 2001/5/1

Y1 - 2001/5/1

N2 - 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

AB - 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

KW - formal languages

KW - multiprocessing systems

KW - performance evaluation

KW - process algebra

KW - PEPA models

KW - Performance Evaluation Process Algebra

KW - formal language

KW - model aggregation

KW - multiprocessor

KW - performance modeling

KW - Algebra

KW - Context modeling

KW - Explosions

KW - Formal languages

KW - Partitioning algorithms

KW - Performance analysis

KW - Prototypes

KW - State-space methods

KW - Stochastic processes

KW - Timing

U2 - 10.1109/32.922715

DO - 10.1109/32.922715

M3 - Article

SN - 0098-5589

VL - 27

SP - 449

EP - 464

JO - IEEE Transactions on Software Engineering

JF - IEEE Transactions on Software Engineering

IS - 5

ER -

An efficient algorithm for aggregating PEPA models

Abstract / Description of output

Keywords / Materials (for Non-textual outputs)

Access to Document

Fingerprint

Cite this