## The PEPA Workbench: A Tool to Support a Process Algebra-based Approach to Performance Modelling (1994)

### Cached

### Download Links

- [www.dcs.ed.ac.uk]
- [www.dcs.ed.ac.uk]
- [www.dcs.ed.ac.uk]
- [www.dcs.ed.ac.uk]
- [homepages.inf.ed.ac.uk]
- DBLP

### Other Repositories/Bibliography

Venue: | In Proceedings of the Seventh International Conference on Modelling Techniques and Tools for Computer Performance Evaluation, number 794 in Lecture Notes in Computer Science |

Citations: | 155 - 59 self |

### BibTeX

@INPROCEEDINGS{Gilmore94thepepa,

author = {Stephen Gilmore and Jane Hillston},

title = {The PEPA Workbench: A Tool to Support a Process Algebra-based Approach to Performance Modelling},

booktitle = {In Proceedings of the Seventh International Conference on Modelling Techniques and Tools for Computer Performance Evaluation, number 794 in Lecture Notes in Computer Science},

year = {1994},

pages = {353--368},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

. In this paper we present a new technique for performance modelling and a tool supporting this approach. Performance Evaluation Process Algebra (PEPA) [1] is an algebraic language which can beused to build models of computer systems which capture information about the performance of the system. The PEPA language serves two purposes as a formal description language for computer system models. The performance-related information in the model may be used to predict the performance of the system whereas the behavioural information in the model may be exploited when reasoning about the functional behaviour of the system (e.g. when finding deadlocks or when exhibiting equivalences between sub-components). In this paper we concentrate on the performance aspects of the language. A method of reasoningaboutPEPA modelsproceedsby considering the derivation graph obtained from the model using the underlying operational semantics of the PEPA language. The derivation graph is systematically reduced ...

### Citations

3202 |
Communication and Concurrency
- Milner
(Show Context)
Citation Context ...al of the work described here is to provide a workbench for a designer of a computer system who is working from an initial PEPA model. As with other languages based on algebra and processes, e.g. CCS =-=[4]-=-, PEPA is a parsimonious language which provides the essential, simple tools for system description. The formality and succinctness of the language have enabled the authors to design and build a workb... |

595 | A compositional approach to performance modelling
- Hillston
- 1996
(Show Context)
Citation Context ...m the area of communication networks. 2 The PEPA Language The motivation for process algebra-based techniques for the quantitative analysis of computer systems have been presented in detail elsewhere =-=[5, 6]-=-. Some of the advantages of such an approach are: -- The system is represented as a collection of active agents who cooperate to achieve the behaviour of the system. This cooperator paradigm is partic... |

202 |
The Concurrency Workbench: A semantics-based tool for the verification of finite-state systems
- Cleaveland, Parrow, et al.
- 1993
(Show Context)
Citation Context ...tandard ML language was chosen as the implementation language for the workbench because it had previously been successfully used for the implementation of the Concurrency Workbench (for CCS and TCCS) =-=[16]-=- and choosing the same language may allow us to re-use some of the Concurrency Workbench code. Standard ML has also been used for theorem provers and other software tools locally since it provides hig... |

172 |
A temporal calculus of communicating systems
- Moller, Tofts
- 1990
(Show Context)
Citation Context ...ess. From a performance point of view, process algebras, such as CCS, lack essential, quantifiable information about time and uncertainty. Timed extensions of some process algebras have been proposed =-=[9, 10, 11, 12]-=- but these make a distinction between time progressing and computation progressing. PEPA, and TIPP, developed at Erlangen, take an alternative approach---time is incorporated into the algebra by assoc... |

140 | An overview and synthesis on timed process algebras
- Nicollin, Sifakis
- 1992
(Show Context)
Citation Context ...ess. From a performance point of view, process algebras, such as CCS, lack essential, quantifiable information about time and uncertainty. Timed extensions of some process algebras have been proposed =-=[9, 10, 11, 12]-=- but these make a distinction between time progressing and computation progressing. PEPA, and TIPP, developed at Erlangen, take an alternative approach---time is incorporated into the algebra by assoc... |

127 |
a formal description technique based on the temporal ordering of observational behaviour
- LOTOS
- 1989
(Show Context)
Citation Context ...delling language. -- The formal definition clarifies the task of providing tools for model manipulation, simplification and analysis. -- Process algebra has growing importance as a design methodology =-=[7, 8]-=- and so this approach offers the possibility of integrating performance analysis into the system design process. From a performance point of view, process algebras, such as CCS, lack essential, quanti... |

110 | M.: Multiprocessor and distributed systems design: The integration of functional specification and performance analysis using stochastic process algebras
- Gotz, Herzog, et al.
- 1993
(Show Context)
Citation Context ...m the area of communication networks. 2 The PEPA Language The motivation for process algebra-based techniques for the quantitative analysis of computer systems have been presented in detail elsewhere =-=[5, 6]-=-. Some of the advantages of such an approach are: -- The system is represented as a collection of active agents who cooperate to achieve the behaviour of the system. This cooperator paradigm is partic... |

106 |
Recursive Programming Techniques
- Burge
- 1975
(Show Context)
Citation Context ... has a favourable consequence since using these tools would mean that they would be added to the exported image of the workbench, making it larger than really necessary. Instead, a Burge-style parser =-=[17]-=- has been produced for the PEPA language. This is a compact, elegant functional program which uses infix function symbols to encode the operators which combine productions in a formal description nota... |

69 |
A Brief History of Timed CSP
- Davies, Schneider
- 1995
(Show Context)
Citation Context ...ess. From a performance point of view, process algebras, such as CCS, lack essential, quantifiable information about time and uncertainty. Timed extensions of some process algebras have been proposed =-=[9, 10, 11, 12]-=- but these make a distinction between time progressing and computation progressing. PEPA, and TIPP, developed at Erlangen, take an alternative approach---time is incorporated into the algebra by assoc... |

44 | Process Algebra for Discrete Event Simulation
- Strulo
- 1993
(Show Context)
Citation Context |

40 |
Queueing analysis of polling models: an update
- Takagi
- 1990
(Show Context)
Citation Context ...he workbench, in an example taken from the study of communication systems. Polling systems have been used extensively over the last twenty years to investigate many computer and communication systems =-=[18]-=-. In these systems a single server circulates amongst a number of queues providing service according to a predetermined discipline. Extracting performance measures for these systems is non-trivial sin... |

34 |
G.: A class of generalised stochastic Petri nets for the performance evaluation of multiprocessor systems
- Marsan, Conte, et al.
- 1984
(Show Context)
Citation Context ...abilistic branching, and the timing behaviour of the system is captured. This is analogous to the association of a duration with the firing of a timed transition in a generalised stochastic Petri net =-=[13]-=-. It was important when designing the PEPA language to retain the key features of a process algebra which had motivated the approach: compositionality,parsimony, and the existence of a formal definiti... |

30 |
Tipp – a language for timed processes and performance evaluation
- Götz, Herzog, et al.
- 1992
(Show Context)
Citation Context ...resampling). This allows us to formulate Expansion Laws of the form shown below: this would not be possible if another distribution were associated with activity durations as in some versions of TIPP =-=[14]-=-. Expansion Law Let P j P 1 BC L P 2 . Then P = X f(ff; r):(P 0 1 BC L P 2 ) : P 1 (ff;r) \Gamma! P 0 1 ; ff = 2 Lg + X f(ff; r):(P 1 BC L P 0 2 ) : P 2 (ff;r) \Gamma! P 0 2 ; ff = 2 Lg + X f(ff; r):(... |

12 |
The design of communicating systems: a system engineering approach
- Koomen
- 1991
(Show Context)
Citation Context ...delling language. -- The formal definition clarifies the task of providing tools for model manipulation, simplification and analysis. -- Process algebra has growing importance as a design methodology =-=[7, 8]-=- and so this approach offers the possibility of integrating performance analysis into the system design process. From a performance point of view, process algebras, such as CCS, lack essential, quanti... |

11 |
GSPN models of Markovian multiserver multiqueue systems. Performance Evaluation
- Marsan, Donatelli, et al.
- 1990
(Show Context)
Citation Context ...nt on the congestion at the other queues in the system. Recently these systems have been extended by the introduction of one or more additional servers to form multi-server multi-queue (MSMQ) systems =-=[19]-=-. MSMQ systems have been used to model applications in which multiple resources are shared among several users, possibly with differing requirements. In particular these models have been applied to lo... |

10 |
Composite Performance and Availability Analysis Using a Hierarchy of Stochastic Reward Nets
- Muppala, Trivedi
- 1991
(Show Context)
Citation Context ...ple Software. Reward Structures and Derivation of Performance Measures Performance measures are derived by defining a reward structure over a model in a similar way to the use of reward structures in =-=[15]-=-. Reward structures have generally been explicitly treated only in the context of performability modelling, where reliability and performance aspects of a system are considered together. However, such... |

1 |
Performance Analysis of Multiple Token Ring and Multiple Slotted Ring Networks
- Yang, Ghosal, et al.
- 1986
(Show Context)
Citation Context ...h ring topologies and scheduled access, in which more than onenodemay transmit simultaneously. For example, slotted rings and rings with multiple tokens are modelled as MSMQ systems by Yang et al. in =-=[20]-=-. Exact solutions for MSMQ systems have only recently been provided by Ajmone Marsan et al., [19]. In this paper we extend the class of asymmetric models considered by those authors. In [19] they cons... |