#### Filter Results:

- Full text PDF available (100)

#### Publication Year

1980

2017

- This year (1)
- Last 5 years (34)
- Last 10 years (76)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### 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)

Prograxnming parallel machines is notoriously difficult. Factors contributing to this difficulty include the complexity of concurrency, the effect of resource allocation on performance and the current diversity of parallel machine models. The net result is that effective portability, which depends crucially on the predictability of performance, has been… (More)

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

Programming parallel machines is notoriously diicult. Factors contributing to this diiculty include the complexity of concurrency, the eeect of resource allocation on performance and the current diversity of parallel machine models. The net result is that eeective portability, which depends crucially on the predictability of performance, has been lost.… (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, 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, B. Strulo
- J. Log. Comput.
- 2000

Semi-Markov processes (SMPs) are expressive tools for modelling concurrent systems; they are a generalisation of Markov processes that allow for arbitrarily distributed sojourn times. This paper presents an iterative technique for passage time and transient analysis of large structurally unrestricted semi-Markov processes. Our method is based on the… (More)