AESOP home

Publications

Expanding The Boundaries Of Performance Requirement Representation With Performance Trees

Tamas Suto

Conference or Workshop Paper
PASTA'06, 5th Workshop on Process Algebra and Stochastically Timed Activities
May, 2006
Imperial College London, Department of Computing
Abstract

We introduce Performance Trees (PTs), a novel representation formalism for the specification of model-based performance queries. Traditionally, stochastic logics have been the prevalent means of performance requirement expression; however, in practice, their use amongst system designers is limited on account of their inherent complexity and restricted expressive power. PTs are a more accessible alternative, in which performance queries are represented by hierarchical tree structures. This allows for the convenient visual composition of complex performance questions, and enables not only the verification of stochastic requirements, but also the direct extraction of performance measures. In addition, the tree formalism offers a superset of the expressiveness of Continuous Stochastic Logic (CSL), since all CSL formulae can be represented as PTs.

PTs can be used to capture passage time, transient, steady-state and higher order queries of varying levels of sophistication. While they are conceptually independent of the underlying stochastic modelling formalism, in many cases the tree operators we use are already backed up by good algorithmic and tool support for both stochastic verification and performance measure extraction.

PDF of full publication (97 kilobytes)
(need help viewing PDF files?)
PDF of presentation slides (445 kilobytes)

Information from pubs.doc.ic.ac.uk/pts-pasta2006.