A compositional approach to performance modelling
A compositional approach to performance modelling
Model-checking continuous-time Markov chains
ACM Transactions on Computational Logic (TOCL)
An Efficient Kronecker Representation for PEPA Models
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
WOSP '04 Proceedings of the 4th international workshop on Software and performance
Model Checking Action- and State-Labelled Markov Chains
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Fluid Flow Approximation of PEPA models
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
CSL^TA: an Expressive Logic for Continuous-Time Markov Chains
QEST '07 Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems
QEST '07 Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems
Evaluating quality of service for service level agreements
FMICS'06/PDMC'06 Proceedings of the 11th international workshop, FMICS 2006 and 5th international workshop, PDMC conference on Formal methods: Applications and technology
Location-aware quality of service measurements for service-level agreements
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
PRISM: a tool for automatic verification of probabilistic systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
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
Quantitative Analysis of Web Services Using SRMC
Formal Methods for Web Services
EPEW '09 Proceedings of the 6th European Performance Engineering Workshop on Computer Performance Engineering
Process Algebra with Hooks for Models of Pattern Formation
Electronic Notes in Theoretical Computer Science (ENTCS)
Computing first passage time distributions in stochastic well-formed nets
Proceedings of the 2nd ACM/SPEC International Conference on Performance engineering
Evaluating service level agreements using observational probes
Rigorous software engineering for service-oriented systems
Passage-end analysis for analysing robot movement
Rigorous software engineering for service-oriented systems
Quantitative analysis of services
Rigorous software engineering for service-oriented systems
Visualisation for stochastic process algebras: the graphic truth
EPEW'11 Proceedings of the 8th European conference on Computer Performance Engineering
Proceedings of the 2013 ACM SIGSIM conference on Principles of advanced discrete simulation
Expressing and computing passage time measures of GSPN models with HASL
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
| Hi-index | 0.00 |
We define a mechanism for specifying performance queries which combine instantaneous observations of model states and finite sequences of observations of model activities. We realise these queries by composing the state-aware observers (called eXtended Stochastic Probes(XSP)) with a model expressed in a stochastically-timed process algebra. Our work has been conceived in the context of the process algebra PEPA. However the ideas involved are relevant to all timed process algebras with an underlying discrete-state representation such as a continuous-time Markov chain.