PEPA nets: A structured performance modelling formalism

DOI10.1007/3-540-46029-2_7MaRDI QIDQ4738769zbMATH OpenFDO

Authors Stephen Gilmore, Jane Hillston, Marina Ribaudo

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2324/23240111.htm, https://www.research.ed.ac.uk/en/publications/a9f51981-5ab1-4b13-9d69-0b0d9d54bfce

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A Compositional Approach to Performance Modelling
• Product form solution for a class of PEPA models
• A net level performance analysis of stochastic Petri nets
• Stochastic process algebras
• scientific article; zbMATH DE number 1131474

Cited in

(11)

• Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC
• Abstract interpretation of PEPA models
• PEPA queues: capturing customer behaviour in queueing networks
• Coping with the Parallelism of BitTorrent: Conversion of PEPA to ODEs in Dealing with State Space Explosion
• A Precedence PEPA Model for Performance and Reliability Analysis
• Implementing a stochastic process algebra within the Möbius modeling framework
• The PEPA feature construct
• A Compositional Approach to Performance Modelling
• Hybrid performance modelling of opportunistic networks
• Equivalence checking 40 years after: a review of bisimulation tools
• Formal techniques for performance analysis: blending SAN and PEPA

Describes a project that uses

Uses Software

• PRISM
• PEPA
• Möbius

This page was built for publication: PEPA nets: A structured performance modelling formalism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4738769)