Specification patterns for probabilistic quality properties
Proceedings of the 30th international conference on Software engineering
Natural Language Specification of Performance Trees
EPEW '08 Proceedings of the 5th European Performance Engineering Workshop on Computer Performance Engineering
Electronic Notes in Theoretical Computer Science (ENTCS)
PIPE2: a tool for the performance evaluation of generalised stochastic Petri Nets
ACM SIGMETRICS Performance Evaluation Review
Scalable Analysis of Scalable Systems
FASE '09 Proceedings of the 12th International Conference on Fundamental Approaches to Software Engineering: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Automatic Generation of Performance Analysis Results: Requirements and Demonstration
EPEW '09 Proceedings of the 6th European Performance Engineering Workshop on Computer Performance Engineering
Monitoring probabilistic properties
Proceedings of the the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Towards Context Independent Extra-functional Properties Descriptor for Components
Electronic Notes in Theoretical Computer Science (ENTCS)
Visualisation for stochastic process algebras: the graphic truth
EPEW'11 Proceedings of the 8th European conference on Computer Performance Engineering
Proceedings of the 5th ACM/SPEC international conference on Performance engineering
| Hi-index | 0.00 |
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, PTs offer a superset of the expressiveness of Continuous Stochastic Logic (CSL) since all CSL formulae can be translated into PT form. Performance Trees can be used to represent 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. We do not therefore perceive major barriers to the integration of PTs into existing stochastic model checking tools. Indeed, we illustrate how semi-Markov passage time computation algorithms, based on numerical Laplace transform inversion, can be directly applied to the resolution of a case study PT query.