© 1995 by British Computer Society
| ||||||||||||||||||||||||||||||||||||||||||||||||||||
Exploiting Quasi-reversible Structures in Markovian Process Algebra Models
1 Department of Computing, Imperial College, 180 Queens Gate, London SW7 2BZ, UK, 2 Department of Computer Science, University of Edinburgh, Edinburgh EH9 3JZ, UK Email: pgh{at}doc.ic.ac.uk, jeh{at}dcs.ed.ac.uk
Efficient 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. Markovian process algebras (MPA) extend classical process algebras with information about the duration of actions but retain their compositional structure: a system is modelled as an interaction of components. The advantages of this compositional structure for model construction and model simplification have already been demonstrated. In this paper we exploit results from queueing networks to identify a restricted form of interaction between suitable MPA components which leads to a product form solution. Each component of the model may be solved separately and the compositional structure of an MPA consequently facilitates efficient solution for successively more complex models. This work uses the notion of quasi-reversibility in a Markov process setting to define the type of interaction between MPA components. This leads to a substantial class of MPA definitions that have product-form solutions which is more general than the usual queueing network-based class of Markov processes.
* Department of Computer Science, University of Edinburgh, Edinburgh EH9 3JZ, UK Email: pgh{at}doc.ic.ac.uk, jeh{at}dcs.ed.ac.uk
Department of Computing, Imperial College, 180 Queens Gate, London SW7 2BZ, UK