Software performance modelling using PEPA nets

ABSTRACT

Modelling and analysing distributed and mobile software systems is a challenging task. PEPA nets---coloured stochastic Petri nets---are a recently introduced modelling formalism which clearly capture important features such as location, synchronisation and message passing. In this paper we describe PEPA nets and the newly-developed platform support for software performance modelling using them. Crucial to this support is the compilation from PEPA nets into Hillston's PEPA stochastic process algebra in order to access the software tools which support the PEPA algebra. In addition to derivation of steady state performance measures, this suite of tools allows properties of the system to be verified using model-checking. We show the application of PEPA nets in the modelling and analysis of a secure Web service.

REFERENCES

• 1: Stephen Gilmore , Jane Hillston , Leila Kloul , Marina Ribaudo, PEPA nets: a structured performance modelling formalism, Performance Evaluation, v.54 n.2, p.79-104, 1 October 2003 [doi>10.1016/S0166-5316(03)00069-5]
• 2: Jane Hillston, A compositional approach to performance modelling, Cambridge University Press, New York, NY, 1996
• 3: Stephen Gilmore , Jane Hillston, The PEPA workbench: a tool to support a process algebra-based approach to performance modelling, Proceedings of the 7th international conference on Computer performance evaluation : modelling techniques and tools: modelling techniques and tools, p.353-368, June 1994, Vienna, Austria
• 4: Martin Odersky , Philip Wadler, Pizza into Java: translating theory into practice, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.146-159, January 15-17, 1997, Paris, France [doi>10.1145/263699.263715]
• 5: Fotis Stathopoulos. Enhancing the PEPA Workbench with simulation and experimentation facilities. Master's thesis, School of Computer Science, Division of Informatics, The University of Edinburgh, 2001.
• 6: G. Clark. Techniques for the Construction and Analysis of Algebraic Performance Models. PhD thesis, The University of Edinburgh, 2000.
• 7: Kim G. Larsen , Arne Skou, Bisimulation through probabilistic testing, Information and Computation, v.94 n.1, p.1-28, Sept. 1991 [doi>10.1016/0890-5401(91)90030-6]
• 8: Adnan Aziz , Kumud Sanwal , Vigyan Singhal , Robert K. Brayton, Verifying Continuous Time Markov Chains, Proceedings of the 8th International Conference on Computer Aided Verification, p.269-276, August 03, 1996
• 9: Graham Clark , Tod Courtney , David Daly , Dan Deavours , Salem Derisavi , Jay M. Doyle , William H. Sanders , Patrick Webster, The Möbius Modeling Tool, Proceedings of the 9th international Workshop on Petri Nets and Performance Models (PNPM'01), p.241, September 11-14, 2001
• 10: Graham Clark , William H. Sanders, Implementing a Stochastic Process Algebra within the Möbius Modeling Framework, Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification, p.200-216, September 12-14, 2001
• 11: Marta Z. Kwiatkowska , Gethin Norman , David Parker, Probabilistic Symbolic Model Checking with PRISM: A Hybrid Approach, Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, p.52-66, April 08-12, 2002
• 12: E Somenzi. CUDD: CU Decision Diagram Package. Department of Electrical and Computer Engineering, University of Colorado at Boulder, February 2001.
• 13: J. T. Bradley, N. J. Dingle, S. T. Gilmore, and W. J. Knottenbelt. Derivation of passage-time densities in PEPA models using IPC: The Imperial PEPA Compiler. In G Kotsis, editor, Proceedings of the 11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems, pages 344--351, University of Central Florida, October 2003. IEEE Computer Society Press.
• 14: W. J. Knottenbelt. Generalised Markovian analysis of timed transition systems. Master's thesis, University of Cape Town, 1996.
• 15: J. T. Bradley, N. J. Dingle, S. T. Gilmore, and W. J. Knottenbelt. Extracting passage times from PEPA models with the HYDRA tool: A case study. In S. Jarvis, editor, Proceedings of the Nineteenth annual UK Performance Engineering Workshop, pages 79--90, University of Warwick, July 2003.
• 16: Ashok Argent-Katwala , Jeremy T. Bradley , Nicholas J. Dingle, Expressing performance requirements using regular expressions to specify stochastic probes over process algebra models, Proceedings of the 4th international workshop on Software and performance, January 14-16, 2004, Redwood Shores, California

INDEX TERMS

Primary Classification:
  D. Software
  D.2 SOFTWARE ENGINEERING
      D.2.1 Requirements/Specifications
          Subjects: Methodologies (e.g., object-oriented, structured)

Additional Classification:
  D. Software
  D.2 SOFTWARE ENGINEERING
      D.2.8 Metrics
          Subjects: Performance measures
  D.3 PROGRAMMING LANGUAGES
      D.3.2 Language Classifications

Keywords:
PEPA nets, mobile objects, performance analysis