Process Algebraic Non-product-forms

Authors:
P. G. Harrison
Affiliations:
Department of Computing, Imperial College London, England
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2006

Citing 5
Cited 2

Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

Journal of the ACM (JACM)
A Characterization of Independence for Competing Markov Chains with Applications to Stochastic Petri Nets

IEEE Transactions on Software Engineering
Turning back time in Markovian process algebra

Theoretical Computer Science
Compositional reversed Markov processes, with applications to G-networks

Performance Evaluation
Jobshop-Like Queueing Systems

Management Science

An initiative for a classified bibliography on G-networks

Performance Evaluation
Bibliography on G-networks, negative customers and applications

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

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.