Eﬃcient product form solution is one of the major attractions of queueing networks for performance modelling purposes. These models rely on a form of interaction between nodes in a network which allows them to be solved in isolation, since they behave as if independent up to normalisation. Several papers have explored the extent to which product form structures can be identiﬁed in models expressed in a Markovian process algebra (MPA). In , Harrison and Hillston presented a syntactic characterisation of MPA models which give rise to quasi-reversible structure, leading to product form solution. This characterisation means that models may be systematically checked for the quasi-reversible property, without expanding the state space. It is one of the features of process algebra models, however, that diﬀerent syntactic presentations may give rise to the same underlying structure. In this paper we describe a set of transformations which may be used to manipulate the syntactic presentation of a PEPA model, thus allowing a previously obscured quasi-reversible structure to be detected.
|Title of host publication||Proceedings of the Workshop on Process Algebra and Stochastically Timed Activities (PASTA 2002)|
|Number of pages||16|
|Publication status||Published - 2002|