Exploiting Quasi-reversible Structures in Markovian Process Algebra Models

  title={Exploiting Quasi-reversible Structures in Markovian Process Algebra Models},
  author={Peter G. Harrison and Jane Hillston},
  journal={Comput. J.},
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… 

A two-level decomposition scheme for Markovian process algebra models

This work proposes a novel approach to solve MPA models which explicitly exploits the concurrent nature of the given model, and derives a novel result on cumulative measures of absorbing joint Markov chains.

A Syntactical Analysis of Reversible PEPA

Product form solutions have played an important role in the development of performance modelling and in particular in the popularity of queueing network models. The notions of reversibility and

On the relations among product-form stochastic models

Two results, the M ⇒ M property and the Reversed Compound Agent Theorem (RCAT) are used to explore the relations among several product-form model classes belonging to different formalisms: queueing networks (QN), stochastic Petri nets (SPN), generalized stochasia nets (GSPn), Markovian Process Algebra (MPA), and it is proved that previous results on product- form SPNs can be studied using RCAT.

Lumping and reversed processes in cooperating automata

A notion of typed lumpability is introduced, which gives sufficient conditions under which a lumping of the process can be derived, allowing the exact computation of marginal stationary probabilities of the cooperating components.

Applying Quasi-Separability to Markovian Process Algebra

A class of models which do not give rise to a product form solution but can nevertheless be decomposed into their components without loss of generality is studied.

Time Scale Decomposition of Stochastic Process Algebra Models

This work presents a major advancement related to a preliminary version of this technique already presented at a workshop of this series, and develops a transformation technique based on a delayed choice operator and preserves equivalence.

Product form solution for an insensitive stochastic process algebra structure

Product form solution for a class of PEPA models

  • J. HillstonN. Thomas
  • Computer Science
    Proceedings. IEEE International Computer Performance and Dependability Symposium. IPDS'98 (Cat. No.98TB100248)
  • 1998
It is shown that PEPA models that generate such processes may be readily identified and show how the product form solution may be obtained and can be easily generalised to any of the other stochastic process algebra languages.

Stochastic Process Algebra Structure for Insensitivity

  • G. Clark
  • Mathematics, Computer Science
  • 1999
A construction which guarantees the insensitivity of certain concurrently enabled non-connicting stochastic process algebra activities is described, and a derived combinator is given for constructing process algebra models that do not match any of those currently known to exist for stochastically process algebra.

Using Markovian Process Algebra to Specify Interactions in Queueing Systems

It is shown that the most common interactive behaviours found in queueing systems can be modelled simply in a Markovian process algebra, and discusses how such specifications can lead to an automated numerical solution method.



Compositional Markovian Modelling Using a Process Algebra

We introduce a stochastic process algebra, PEPA, as a high-level modelling paradigm for continuous time Markov chains (CTMC). Process algebras are mathematical theories which model concurrent systems

The nature of synchronisation

In each of the current stochastic process algebras all non-c ompetitive interactions between components or agents are modelled using a single combinator, variously called the parallel,

Performance modelling of communication networks and computer architectures

This chapter discusses the construction of BCMP networks, a model of queueing networks for parallel processing systems, and some of the algorithms used to design and implement these networks.

A class of generalised stochastic petri nets for the performance evaluation of multiprocessor systems

Graph models have been proposed by many authors as a useful tool for the analysis of peculiar features of computer systems such as concurrency, synchronization, communication, and cooperation among

A compositional approach to performance modelling

Modelling study: multi-server multi-queue systems shows strong equivalence between strong and weak isomorphism and strong bisimilarity.

Reversibility and Stochastic Processes

  • Reversibility and Stochastic Processes
  • 1979

Apr.). A Compositional Approach

  • 1994

The Computer Journal

The table shows that the method can be very effective even if the individual functions do not tend to zero at the minimum. The number of function values quoted for 8 = 0 is less than the

Towards a Product Form Solution

  • 1995

Towards a Product Form Solution of Stochastic Process Algebras. The Computer Journal , this issue

  • Towards a Product Form Solution of Stochastic Process Algebras. The Computer Journal , this issue
  • 1995