Computing Publications

Publications Home » Process algebraic non-product-forms

Process algebraic non-product-forms

Peter G. Harrison

Conference or Workshop Paper
Practical Aspects of Stochastic Modelling (PASM'05), Newcastle, July 2005
June, 2006
Electronic Notes in Theoretical Computer Science
Volume 151
Issue 3
pp.61–76
Elsevier
DOI 10.1016/j.entcs.2006.03.012
Abstract

A generalization of the Reversed Compound Agent Theorem of Markovian process algebra is derived that yields separable, but non-product-form solutions for collections of interacting processes such as arise in multi-class queueing networks with Processor Sharing servers. It is based on an analysis of the minimal cycles in the state space of a multi-agent cooperation, which can be simply identified. The extended methodology leads to what we believe are new separable solutions and, more generally, the results represent a viable practical application of the theory of Markovian process algebras in stochastic modelling.

Keywords
AESOP
PDF of full publication (202 kilobytes)
(need help viewing PDF files?)
BibTEX file for the publication
N.B.
Conditions for downloading publications from this site.
 

pubs.doc.ic.ac.uk: built & maintained by Ashok Argent-Katwala.