ACM Transactions on Computer Systems (TOCS)
An attack on the Needham-Schroeder public-key authentication protocol
Information Processing Letters
A compositional approach to performance modelling
A compositional approach to performance modelling
Using encryption for authentication in large networks of computers
Communications of the ACM
An Efficient Algorithm for Aggregating PEPA Models
IEEE Transactions on Software Engineering
Fluid Flow Approximation of PEPA models
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
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
Approximate Solution of a PEPA Model of a Key Distribution Centre
SIPEW '08 Proceedings of the SPEC international workshop on Performance Evaluation: Metrics, Models and Benchmarks
Location-aware quality of service measurements for service-level agreements
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Quantitative Analysis of Web Services Using SRMC
Formal Methods for Web Services
Fluid computation of passage-time distributions in large Markov models
Theoretical Computer Science
Formal performance modelling: from protocols to people
EPEW'12 Proceedings of the 9th European conference on Computer Performance Engineering
Formal performance modelling: from protocols to people
EPEW'12 Proceedings of the 9th European conference on Computer Performance Engineering
| Hi-index | 0.00 |
We present an application of partial evaluationto performance models expressed in the PEPA stochastic process algebra [1]. We partially evaluate the state-space of a PEPA model in order to remove uses of the cooperation and hiding operators and compile an arbitrary sub-model into a single sequential component. This transformation is applied to PEPA models which are not in the correct form for the application of the fluid-flow analysis for PEPA [2]. The result of the transformation is a PEPA model which is amenable to fluid-flow analysis but which is strongly equivalent[1] to the input PEPA model and so, by an application of Hillston's theorem, performance results computed from one model are valid for the other. We apply the method to a Markovian model of a key distribution centre used to facilitate secure distribution of cryptographic session keys between remote principals communicating over an insecure network.