skip to main content
article

Software performance modelling using PEPA nets

Published:01 January 2004Publication History
Skip Abstract Section

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. S. Gilmore, J. Hillston, M. Ribaudo, and L. Kloul. PEPA nets: A structured performance modelling formalism. Performance Evaluation, 54(2):79--104, October 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. J. Hillston. A Compositional Approach to Performance Modelling. Cambridge University Press, 1996.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. S. Gilmore and J. Hillston. The PEPA Workbench: A Tool to Support a Process Algebra-based Approach to Performance Modelling. In Proceedings of the Seventh International Conference on Modelling Techniques and Tools for Computer Performance Evaluation, number 794 in Lecture Notes in Computer Science, pages 353--368, Vienna, May 1994. Springer-Verlag.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. M. Odersky and P. Wadler. Pizza into Java: Translating theory into practice. In Proceedings of the 24th ACM Symposium on Principles of Programming Languages (POPL'97), Paris, France, pages 146--159. ACM Press, New York (NY), USA, 1997.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  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.]]Google ScholarGoogle Scholar
  6. G. Clark. Techniques for the Construction and Analysis of Algebraic Performance Models. PhD thesis, The University of Edinburgh, 2000.]]Google ScholarGoogle Scholar
  7. Kim Guldstrand Larsen and Arne Skou. Bisimulation through probabilistic testing. Information and Computation, 94(I):1--28, 1991.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. A. Aziz, K. Sanwal, V. Singhal, and R. Brayton. Verifying continuous time Markov chains. In Computer-Aided Verification, volume 1102"of LNCS, pages 169--276. Springer-Verlag, 1996.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. G. Clark, T. Courtney, D. Daly, D. Deavours, S. Derisavi, J. M. Doyle, W. H. Sanders and P. Webster. The Möbius modeling tool. In Proceedings of the 9th International Workshop on Petri Nets and Performance Models, pages 241--250, Aachen, Germany, September 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. G. Clark and W. H. Sanders. Implementing a stochastic process algebra within the Möbius modeling framework. In L. de Alfaro and S. Gilmore, editors, Proceedings of the first joint PAPM-PROBMIV Workshop, volume 2165 of Lecture Notes in Computer Science, pages 200--215, Aachen, Germany, September 2001. Springer-Verlag.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. M. Kwiatkowska, G. Norman, and D. Parker. Probabilistic symbolic model checking with PRISM: A hybrid approach. In J.-P. Katoen and P. Stevens, editors, Proc. 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'02), volume 2280 of LNCS, pages 52--66. Springer, April 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. E Somenzi. CUDD: CU Decision Diagram Package. Department of Electrical and Computer Engineering, University of Colorado at Boulder, February 2001.]]Google ScholarGoogle Scholar
  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.]]Google ScholarGoogle ScholarCross RefCross Ref
  14. W. J. Knottenbelt. Generalised Markovian analysis of timed transition systems. Master's thesis, University of Cape Town, 1996.]]Google ScholarGoogle Scholar
  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.]]Google ScholarGoogle Scholar
  16. A. Argent-Katwala, J. T. Bradley, and N. J. Dingle. Expressing performance requirements using regular expressions to specify stochastic probes over process algebra models. In Proceedings of the 4th International Workshop on Software and Performance, 2004. This volume.]] Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Software performance modelling using PEPA nets

            Recommendations

            Reviews

            Srini Ramaswamy

            A Petri net-based modeling technique to address the gap in software requirements modeling methodologies for distributed systems is addressed in this paper. Its use is for modeling systems composed of concurrently active components that cooperate and share work responsibilities. It extends the authors' previous work on stochastic process algebra (performance evaluation process algebra (PEPA)), and integrates it within a Petri net-based technique for performance modeling. It is true that traditional modeling and analysis tools for software design and development do not adequately address all of the issues of time, synchronism, and concurrency for distributed systems. This paper illustrates the application of the authors' methodology by using it to model mobile agents and a secure Web service. The paper describes the implementation of a translational process from PEPA nets to PEPA algebra for analysis of the PEPA Petri net model. The tool is available for download from http://www.dcs.ed.ac.uk/pepa/, and is implemented in ML and Java. It contains a complete modeling kit for PEPA, including solvers, time analyzers, model-checkers, and so on. The Web site indicates that the ML edition of the PEPA workbench transforms PEPA descriptions into a form suitable for solution by another solution tool, such as Maple, Matlab, or Mathematica. The Java edition of the PEPA workbench can solve models without the need for a separate solution tool. The PEPA workbench has Linux, Solaris, and Windows distributions and examples, to illustrate using PEPA for the generation of systems with very large state spaces; for example, a PEPA Web service models 26,651,520 states. The work presented here will be very useful for graduate students working in the areas of software modeling, performance analysis, distributed systems, and mobile computing. Online Computing Reviews Service

            Access critical reviews of Computing literature here

            Become a reviewer for Computing Reviews.

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in

            Full Access

            • Published in

              cover image ACM SIGSOFT Software Engineering Notes
              ACM SIGSOFT Software Engineering Notes  Volume 29, Issue 1
              January 2004
              300 pages
              ISSN:0163-5948
              DOI:10.1145/974043
              Issue’s Table of Contents
              • cover image ACM Conferences
                WOSP '04: Proceedings of the 4th international workshop on Software and performance
                January 2004
                313 pages
                ISBN:1581136730
                DOI:10.1145/974044

              Copyright © 2004 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 1 January 2004

              Check for updates

              Qualifiers

              • article

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader