By Topic

Performance Trees: Expressiveness and Quantitative Semantics

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Tamas Suto ; Imperial College London, UK ; Jeremy T. Bradley ; William J. Knottenbelt

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.

Published in:

Quantitative Evaluation of Systems, 2007. QEST 2007. Fourth International Conference on the

Date of Conference:

17-19 Sept. 2007