Computing Publications

Publications Home » Performance Trees: Expressiveness...

Performance Trees: Expressiveness And Quantitative Semantics

Tamas Suto, Jeremy T. Bradley, William J. Knottenbelt

Conference or Workshop Paper
QEST'07, 4th International Conference on the Quantitative Evaluation of Systems
September, 2007
pp.41–50
IEEE Computer Society
ISBN 0-7695-2883-X
DOI 10.1109/QEST.2007.9
Abstract

Performance Trees are a recently-proposed mechanism for the specification of performance properties and measures. They represent an attractive alternative to stochastic logics, since they support traditional stochastic model checking queries, while also allowing for the direct extraction of a wide range of quantitative measures. In this paper we illustrate differences in expressiveness between Performance Trees and Continuous Stochastic Logic (CSL), and present quantitative semantics showing the mathematical basis underlying Performance Tree operators. As a running example, we demonstrate performance query specification with Performance Trees on a stochastic Petri net model of a healthcare system.

Keywords
Stochastic Modelling
AESOP
PDF of Extended version (631 kilobytes)
(need help viewing PDF files?)
PDF of full publication (503 kilobytes)
GZipped Postscript of full publication (583 kilobytes)
(need help viewing GZipped Postscript files?)
GZipped Postscript of Extended version (605 kilobytes)
BibTEX file for the publication
N.B.
Conditions for downloading publications from this site.
 

pubs.doc.ic.ac.uk: built & maintained by Ashok Argent-Katwala.