In this paper we describe a formalism which uses the stochastic process algebra PEPA as the inscription language for labelled stochastic Petri nets. Viewed in another way, the net is used to provide a structure for combining related PEPA systems. The combined modelling language naturally represents such applications as mobile code systems where the PEPA terms are used to model the program code which moves between network hosts (the places in the net). We describe the implementation of a tool to support this modelling formalism and apply this to model a peer-to-peer filestore. © Springer-Verlag Berlin Heidelberg 2002.
Gilmore, S., Hillston, J., & Ribaudo, M. (2002). PEPA Nets: A structured performance modelling formalism. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2324 LNCS, pp. 111–130). Springer Verlag. https://doi.org/10.1007/3-540-46029-2_7