Mapping coloured stochastic Petri nets to stochastic process algebras

L. Brodo, S. Gilmore, J. Hillston, C. Priami

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Global computing applications co-ordinate distributed computations across widely-dispersed hosts. Such systems present formidable design and implementation challenges to software developers and synchronisation, scheduling and performance problems come to the fore. Complex systems such as these can benefit from the application of highlevel performance analysis methods founded on timed process algebras. In this paper we compare the use of two such approaches, the PEPA nets and EOS methods, illustrating our presentation with the example of modelling Web services.
Original languageEnglish
Title of host publicationOn-site proceedings of the ICALP Workshop on Stochastic Petri Nets and Related Formalisms
Subtitle of host publicationUniversity of Dortmund Research Report number 780
Pages47-66
Publication statusPublished - 1 Jun 2003

Fingerprint Dive into the research topics of 'Mapping coloured stochastic Petri nets to stochastic process algebras'. Together they form a unique fingerprint.

Cite this