#### Filter Results:

- Full text PDF available (103)

#### Publication Year

1980

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Peter G. Harrison
- Theor. Comput. Sci.
- 2003

Product-form solutions in Markovian process algebra (MPA) are constructed using properties of reversed processes. The compositionality of MPAs is directly exploited, allowing a large class of hierarchically constructed systems to be solved for their state probabilities at equilibrium. The paper contains new results on both reversed stationary Markov… (More)

- Peter G. Harrison, Naresh M. Patel
- International computer science series
- 1993

- Peter G. Harrison, Ting Ting Lee
- Theor. Comput. Sci.
- 2005

The Reversed Compound Agent Theorem (RCAT) is a compositional result that uses Markovian process algebra (MPA) to derive the reversed process of certain interactions between two continuous time Markov chains at equilibrium. From this reversed process, together with the given, forward process, the joint state probabilities can be expressed as a product-form,… (More)

- P G Harrison, B Strulo
- 1993

We present a process algebra or programming language, based on CCS, which may be used to describe discrete event simulations with parallelism. It has extensions to describe the passing of time and probabilistic choice, either discrete, between a countable number of processes, or continuous to choose a random amount of time to wait. It has a clear… (More)

- Peter G. Harrison, William J. Knottenbelt
- SIGMETRICS
- 2002

Probability distributions of response times are important in the design and analysis of transaction processing systems and computer-communication systems. We present a general technique for deriving such distributions from high-level modelling formalisms whose state spaces can be mapped onto finite Markov chains. We use a load-balanced, distributed… (More)

- Peter G. Harrison, Jane Hillston
- Comput. J.
- 1995

EEcient 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… (More)

- Peter G. Harrison
- Perform. Eval.
- 2004

Stochastic networks defined by a collection of cooperating agents are solved for their equilibrium state probability distribution by a new compositional method. The agents are processes formalised in a Markovian Process Algebra , which enables the reversed stationary Markov process of a cooperation to be determined symbolically under appropriate conditions.… (More)

- Peter G. Harrison, B. Strulo
- J. Log. Comput.
- 2000

- Peter G. Harrison, S. K. Harrison, Naresh M. Patel, Soraya Zertal
- Perform. Eval.
- 2012

A workload analysis technique is presented that processes data from operation type traces and creates a Hidden Markov Model (HMM) to represent the workload that generated those traces. The HMM can be used to create representative traces for performance models, such as simulators, avoiding the need to repeatedly acquire suitable traces. It can also be used… (More)