학술논문

An efficient algorithm for aggregating PEPA models
Document Type
Periodical
Source
IEEE Transactions on Software Engineering IIEEE Trans. Software Eng. Software Engineering, IEEE Transactions on. 27(5):449-464 May, 2001
Subject
Computing and Processing
Algebra
Stochastic processes
State-space methods
Partitioning algorithms
Timing
Performance analysis
Context modeling
Formal languages
Explosions
Prototypes
Language
ISSN
0098-5589
1939-3520
2326-3881
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.