Process Algebraic Non-product-forms

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.

• Type: Journal
• Year: 2006
• Where: ENTCS
• Authors: Peter G. Harrison
• Keywords: ENTCS 2006, Markovian Process Algebras, Multi-class Queueing Networks, Reversed Compound Agent