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.
Information from pubs.doc.ic.ac.uk/pts-expressiveness-semantics.