… i at step k , jumps to state j , given that the global state of the system is X ˆ ( N ) ( k ) = d ˆ : P i
… Consequently, each agent Y j ( N ) in a network with N nodes takes values in S = { s , e , i , r } …

< jats: p> This is the first book presenting a stochastic extension of process algebra, PEPA;
this is shown to be suitable for specifying a Markov process, which can then be applied to …

… The general form of an irreversible reaction j is given by: … (3) Each reaction j is associated
with an action type αj and its … Let us consider a reaction j described by a kinetic law fj and with …

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 …

In this paper we present a novel performance analysis technique for large scale systems
modelled in the stochastic process algebra PEPA. In contrast to the well-known approach of …

… The process algebra which we use is Hillston’s PEPA [11], a Markovian process algebra
which incorporates stochastic durations and probabilistic choices. The system which we …

… i;j is conveniently referred to by a single subscript k, ie, we assume an implicit mapping of
each sequential component Ci;j … He is a coinvestigator with Jane Hillston on the Signal project …

We present an overview of eSkel, a library for skeletal parallel programming. eSkel aims to
maximise the conceptual flexibility afforded by its component skeletons and to facilitate …

In this work we introduce Bio-PEPA, a process algebra for the modelling and the analysis of
biochemical networks. It is a modification of PEPA to deal with some features of biological …

… where q(j, k) is the instantaneous transition rate from state j to state k and π(·) is the steady
… In [34], Hillston and Thomas identified syntactic conditions which a PEPA model must satisfy …