This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Efficient Algorithm for Aggregating PEPA Models
May 2001 (vol. 27 no. 5)
pp. 449-464

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. In this paper, 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.

[1] J. Hillston, A Compositional Approach to Performance Modelling. Cambridge Univ. Press, 1996.
[2] N. Götz, H. Hermanns, U. Herzog, V. Mertsiotakis, and M. Rettelbach, “Stochastic Process Algebras,” Quantitative Methods in Parallel Systems, F. Baccelli, A. Jean-Marie, and I. Mitrani, eds., pp. 3–17, 1995.
[3] M. Bernardo and R. Gorrieri, “A Tutorial on EMPA: A Theory of Concurrent Processes with Nondeterminism, Priorities, Probabilities and Time,” Theoretical Computer Science, vol. 202, nos. 1–2, pp. 1–54, 1998.
[4] J. Hillston, “Compositional Markovian Modeling Using a Process Algebra,” Proc. Second Int'l Workshop Numerical Solution of Markov Chains, Jan. 1995.
[5] S. Gilmore and J. Hillston, “The PEPA Workbench: A Tool to Support a Process Algebra Based Approach to Performance Modeling,” Proc. Seventh Int'l Conf. Modelling Techniques and Tools for Computer Performance Evaluation, pp. 353–368, May 1994.
[6] M. Bernardo, W.R. Cleaveland, S.T. Sims, and W.J. Stewart, “TwoTowers: A Tool Integrating Function and Performance Analysis of Concurrent Systems,” Proc. IFIP Joint Int'l Conf. Formal Description Techniques and Protocol Specification, Testing, and Verification, 1998.
[7] H. Hermanns, U. Herzog, U. Klehmet, V. Mertsiotakis, and M. Siegle, “Compositional Performance Modeling with TIPP Tool,” Proc. Int'l Conf. Modelling Techniques and Tools for Computer Performance Evaluation, R. Puigjaner, ed., Sept. 1998.
[8] J.G. Kemeny and J.L. Snell, Finite Markov Chains. Princeton, N.J.: Van Nostrand, 1960.
[9] R. Milner, Communication and Concurrency. Prentice Hall, 1989.
[10] S. Gilmore, J. Hillston, and D.R.W. Holton, “From SPA Models to Programs,” Proc. Fourth Ann. Workshop Process Algebra and Performance Modelling, M. Ribaudo, ed., pp. 179–198, July 1996.
[11] M. Ribaudo, “On the Aggregation Techniques in Stochastic Petri Nets and Stochastic Process Algebras,” The Computer J., Special Issue Proc. Third Int'l Workshop Process Algebras and Performance Modelling, S. Gilmore and J. Hillston, eds., vol. 38, no. 7, pp. 600–611, Dec. 1995.
[12] G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad, “Stochastic Well-Formed Coloured Nets for Symmetric Modeling Applications,” IEEE Trans. Computers, vol. 42, no. 11, Nov. 1993.
[13] M.K. Molloy, “Performance Analysis Using Stochastic Petri Nets,” IEEE Trans. Computers, vol. 31, no. 9, pp. 913–917, Sept. 1982.
[14] G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad, “Stochastic Well-Formed Coloured Nets and Multiprocessor Modeling Applications,” High-Level Petri Nets, Theory and Application, K. Jensen and G. Rozenberg, eds., 1991.
[15] J.F. Meyer and W.H. Sanders, “Reduced Base Model Construction Methods for Stochastic Activity Networks,” IEEE J. Selected Areas in Comm., vol. 9, no. 1, pp. 25–36, Jan. 1991.
[16] H. Hermanns and U. Herzog, “Compositional Nets and Compositional Aggregation,” Performance Models for Discrete Event Systems with Synchronisations: Formalisms and Analysis Techniques, G. Balbo and M. Silva, eds., vol. 2, pp. 553–582, 1998.
[17] H. Hermanns, U. Herzog, and V. Mertsiotakis, “Stochastic Process Algebras as a Tool for Performance and Dependability Modelling,” Proc. IEEE Int'l Computer Performance and Dependability Symp., pp. 102–111, 1995.
[18] H. Hermanns and M. Ribaudo, “Exploiting Symmetries in Stochastic Process Algebras,” Proc. 12th European Simulation Multiconference, 1998.
[19] M. Rettelbach and M. Siegle, “Compositional Minimal Semantics for the Stochastic Process Algebra TIPP,” Proc. Second Process Algebra and Performance Modelling Workshop, M. Rettelbach and U. Herzog, eds., 1994.
[20] J. Hillston and L. Kloul, “Performance Investigating of an On-Line Auction System,” Concurrency and Computation: Practice and Experience, vol. 13, pp. 23–41, 2001.
[21] G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad, “On Well-Formed Coloured Nets and Their Symbolic Reachability Graph,” Proc. 11th Int'l Conf. Application and Theory of Petri Nets, June 1990. Reprinted in High-Level Petri Nets: Theory and Application, K. Jensen and G. Rozenberg, eds., 1991.

Index Terms:
Performance modeling, model aggregation, performance evaluation tools, stochastic process algebras.
Citation:
Stephen Gilmore, Jane Hillston, Marina Ribaudo, "An Efficient Algorithm for Aggregating PEPA Models," IEEE Transactions on Software Engineering, vol. 27, no. 5, pp. 449-464, May 2001, doi:10.1109/32.922715
Usage of this product signifies your acceptance of the Terms of Use.