Stochastic process algebras

A Clark, S Gilmore, J Hillston, M Tribastone - International School on …, 2007 - Springer
In this tutorial we give an introduction to stochastic process algebras and their use in
performance modelling, with a focus on the PEPA formalism. A brief introduction is given to …

[图书][B] A process algebraic approach to software architecture design

A Aldini, M Bernardo, F Corradini - 2010 - books.google.com
Inthe? eldofformalmethodsincomputerscience, concurrencytheoryisreceivinga
constantlyincreasinginterest. Thisisespeciallytrueforprocessalgebra. Althoughit had been …

Derivation of passage-time densities in PEPA models using IPC: The Imperial PEPA Compiler

JT Bradley, NJ Dingle, ST Gilmore… - 11th IEEE/ACM …, 2003 - ieeexplore.ieee.org
A technique for defining and extracting passage-time densities from high-level stochastic
process algebra models is presented. Our high-level formalism is PEPA, a popular …

Tuning systems: From composition to performance

J Hillston - The Computer Journal, 2005 - academic.oup.com
This paper gives a summary of some of the work of the Performance Evaluation Process
Algebra (PEPA) project, which was awarded the 2004 Roger Needham Award from the …

Performance modelling with the unified modelling language and stochastic process algebras

C Canevet, S Gilmore, J Hillston… - IEE Proceedings on …, 2003 - research.ed.ac.uk
We describe a software toolset which allows UML modellers to annotate their models with
performance information. An equivalent performance model is extracted from the UML …

Performance evaluation at the software architecture level

S Balsamo, M Bernardo, M Simeoni - … School on Formal Methods for the …, 2003 - Springer
When tackling the construction of a software system, at the software architecture design level
there are two main issues related to the system performance. First, the designer may need to …

Performance investigation of an on‐line auction system

J Hillston, L Kloul - Concurrency and Computation: Practice …, 2001 - Wiley Online Library
The standard design of on‐line auction systems places most of the computational load on
the server and its adjacent links, resulting in a bottleneck in the system. In this paper, we …

Performance evaluation with temporal rewards

JPM Voeten - Performance Evaluation, 2002 - Elsevier
Today many formalisms exist for specifying complex Markov chains. In contrast, formalisms
for specifying rewards, enabling the analysis of long-run average performance properties …

Proving feature non-interaction with alternating-time temporal logic

F Cassez, MD Ryan, PY Schobbens - Language Constructs for Describing …, 2001 - Springer
Abstract Feature Interaction. When engineers design a system with features, they wish to
have methods to prove that the features do not interact in ways which are undesirable. A …

Scheduling parallel jobs with CPU and I/O resource requirements in cluster computing systems

JH Abawajy, SP Dandamudi - 11th IEEE/ACM International …, 2003 - ieeexplore.ieee.org
This paper addresses the problem of an on-line coordinated allocation of processor and I/O
resources in large-scale shared heterogeneous cluster computing systems. Most research in …