Expressing performance requirements using regular expressions to specify stochastic probes over process algebra models
File(s)
Accepted version
Author(s)
Argent-Katwala, A
Bradley, JT
Dingle, NJ
Type
Conference Paper
Abstract
This paper describes how soft performance bounds can be expressed for software systems using stochastic probes over stochastic process algebra models. These stochastic probes are specified using a regular expression syntax that describes the behaviour that must be observed in a model before a performance measurement can be started or stopped. We demonstrate the use of stochastic probes on a 661,960 state parallel, redundant web server model to verify its passage-time performance characteristics.
Date Issued
2004
Citation
ACM SIGSOFT Software Engineering Notes, 2004, 29 (1), pp.49-58
ISBN
9781581136739
1-5811-3673-0
Publisher
ACM
Source Title
4th International Workshop on Software and Performance, WOSP2004, Redwood Shores, CA
Conference
ACM SIGSOFT Software Engineering Notes
Start Page
49
End Page
58
Journal / Book Title
ACM SIGSOFT Software Engineering Notes
Volume
29
Issue
1
Copyright Statement
© ACM, 2004. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM SIGSOFT SOFTWARE ENGINEERING NOTES {VOL:29, ISS:1,2004} http://doi.acm.org/10.1145/974043.974051
Identifier
http://pubs.doc.ic.ac.uk/regular-probes/
Source
4th International Workshop on Software and Performance, WOSP2004, Redwood Shores, CA