Abstract
The probabilistic and stochastic models we have presented in previous chapters represent system behaviour but not its structure, i.e., they take a monolithic view and do not make explicit how the system is composed and what are the interacting components of which it is made. In this last chapter we introduce a language, called PEPA (Performance Evaluation Process Algebra), for composing stochastic processes and carrying out their quantitative analysis. PEPA builds on CSP (Communicating Sequential Processes), a process algebra similar to CCS but with slightly different primitives. In particular, it relies on multiway communication instead of binary (I/O) communication. PEPA actions are labelled with rates and without much effort a CTMC can be derived from the LTS of a PEPA process to evaluate quantitative properties of the modelled system. The advantage is that the PEPA description of the CTMC remains as a blueprint of the system and allows direct re-use of processes.
He who is slowest in making a promise is most faithful in its performance. (Jean-Jacques Rousseau)
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Bruni, R., Montanari, U. (2017). PEPA - Performance Evaluation Process Algebra. In: Models of Computation. Texts in Theoretical Computer Science. An EATCS Series. Springer, Cham. https://doi.org/10.1007/978-3-319-42900-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-42900-7_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42898-7
Online ISBN: 978-3-319-42900-7
eBook Packages: Computer ScienceComputer Science (R0)