skip to main content
article

Expressing performance requirements using regular expressions to specify stochastic probes over process algebra models

Published:01 January 2004Publication History
Skip Abstract Section

Abstract

This paper describes how soft performance bounds can be expressed for software systems using stochastic probes over stochastic process algebra models. These stochastic probes are specified using a regular expression syntax that describes the behaviour that must be observed in a model before a performance measurement can be started or stopped. We demonstrate the use of stochastic probes on a 661, 960 state parallel, redundant web server model to verify its passage-time performance characteristics.

References

  1. L. Giordano, A. Maxtelli, and C. Schwind, "Reasoning about actions in dynamic linear time temporal logic, "Logic Journal of the IGPL, vol. 9, no. 2, pp. 273--287, 2001.]]Google ScholarGoogle ScholarCross RefCross Ref
  2. J. G. Henriksen and P. S. Thiagarajan, "Dynamic linear time temporal logic," Annals of Pure and Applied Logic, vol. 96, no. 1-3, pp. 187--207, 1999.]]Google ScholarGoogle ScholarCross RefCross Ref
  3. M. J. Fischer and R. E. Ladner, "Propositional dynamic logic of regular programs," Journal of Computer and System Sciences, vol. 18, no. 2, pp. 194--211, 1979.]]Google ScholarGoogle ScholarCross RefCross Ref
  4. D. Harel, A. Pnueli, and J. Stavi, "Propositional dynamic logic of nonregular programs," Journal of Computer and System Sciences, vol. 26, no. 2, pp. 222--243, 1983.]]Google ScholarGoogle ScholarCross RefCross Ref
  5. G. De Giacomo and M. Lenzerini, "PDL-based framework for reasoning about actions," in AI*IA '95, Proceedings of the 4th Conference of the Italian Association for Artificial Intelligence, vol. 992 of Lecture Notes in Computer Science, pp. 103--114, Springer-Verlag, 1995.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. D. Calvanese, G. De Giacomo, and M. Y. Vardi, "Reasoning about actions and planning in LTL action theories," in KR'02, Proceedings of the 8th International Conference on Principles of Knowledge Representation and Reasoning (D. Fensel, F. Giunchiglia, D. L. McGuinness, and M.-A. Williams, eds.), (Toulouse), pp. 593--602, Morgan Kaufmann, April 2002.]]Google ScholarGoogle Scholar
  7. B. J. Ross, "Probabilistic pattern matching and the evolution of stochastic regular expressions," International Journal of Applied Intelligence, vol. 13, pp. 285--300, Nov-Dec 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. S. C. Kleene, "Representation of events in nerve nets and finite automata," in Automata Studies (C. E. Shannon and J. McCarthy, eds.), pp. 3--41, Princeton, New Jersey: Princeton University Press, 1956.]]Google ScholarGoogle Scholar
  9. 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 MASCOTS'03, Proceedings of the 11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems (G. Kotsis, ed.), (University of Central Florida), pp. 344--351, IEEE Computer Society Press, October 2003.]]Google ScholarGoogle Scholar
  10. J. Hillston, A Compositional Approach to Performance Modelling, vol. 12 of Distinguished Dissertations in Computer Science. Cambridge University Press, 1996. ISBN 0 521 57189 8.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. S. Gilmore and J. Hillston, "Feature interaction in PEPA", in Process Algebra and Performance Modelling Workshop (C. Priami, ed.), pp. 17--26, Università Degli Studi di Verona, Nice, September 1998.]]Google ScholarGoogle Scholar
  12. S. Gilmore, J. Hillston, and G. Clark, "Specifying performance measures for PEPA", in Proceedings of the 5th International AMAST Workshop on Real-Time and Probabilistic Systems, vol. 1601 of Lecture Notes in Computer Science, (Bamberg), pp. 211--227, Springer-Verlag, 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. G. Clark, Techniques for the Construction and Analysis of Algebraic Performance Models. PhD thesis, Department of Computer Science, University of Edinburgh, Edinburgh EH9 3JZ, UK, 1994. CST-107-94.]]Google ScholarGoogle Scholar
  14. R. Milner, A Calculus of Communicating Systems, vol. 92 of Lecture Notes in Computer Science. Springer-Verlag, 1980.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. M. Ribaudo, "Stochastic Petri net semantics for stochastic process algebras," in PNPM'95, Proceedings of 6th Int. Workshop on Petri Nets and Performance Models, (Durham, North Carolina), pp. 148--157, October 1995.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. W. J. Knottenbelt, "Generalised Markovian analysis of timed transitions systems," MSc thesis, University of Cape Town, South Africa, July 1996.]]Google ScholarGoogle Scholar
  17. J. T. Bradley, N. J. Dingle, P. G. Harrison, and W. J. Knottenbelt, "Distributed computation of passage time quantiles and transient state distributions in large semi-Markov models," in Performance Modelling, Evaluation and Optimization of Parallel and Distributed Systems, (Nice), IEEE Computer Society Press, April 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. J. T. Bradley, N. J. Dingle, W. J. Knottenbelt, and P. G. Harrison, "Performance queries on semi-Markov stochastic Petri nets with an extended Continuous Stochastic Logic," in PNPM'03, Proceedings of Petri Nets and Performance Models (G. Ciardo and W. Sanders, eds.), (University of Illinois at Urbana-Champaign), pp. 62--71, IEEE Computer Society, September 2003.]]Google ScholarGoogle Scholar
  19. N. J. Dingle, P. G. Harrison, and W. J. Knottenbelt, "Response time densities in Generalised Stochastic Petri Net models," in Proceedings of the 3rd International Workshop on Software and Performance (WOSP'2002), (Rome), pp. 46--54, July 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. P. G. Harrison and W. J. Knottenbelt, "Passage-time distributions in large Markov chains," in Proceedings of ACM SIGMETRICS 2002 (M. Martonosi and E. d. S. e Silva, eds.), pp. 77--85, Marina Del Rey, USA, June 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. W. J. Knottenbelt, Parallel Performance Analysis of Large Markov Models. PhD thesis, Imperial College, London, United Kingdom, February 2000.]]Google ScholarGoogle Scholar
  22. W. J. Knottenbelt and P. G. Harrison, "Distributed disk-based solution techniques for large Markov models," in NSMC'99, Proceedings of the 3rd Intl. Conference on the Numerical Solution of Markov Chains, (Zaragoza), pp. 58--75, September 1999.]]Google ScholarGoogle Scholar
  23. W. Grassman, "Means and variances of time averages in Markovian environments," European Journal of Operational Research, vol. 31, no. 1, pp. 132--139, 1987.]]Google ScholarGoogle ScholarCross RefCross Ref
  24. A. Reibman and K. Trivedi, "Numerical transient analysis of Markov models," Computers and Operations Research, vol. 15, no. 1, pp. 19--36, 1988.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. N. J. Dingle, W. J. Knottenbelt, and P. G. Harrison, "HYDRA: HYpergraph-based Distributed Response-time Analyser," in PDPTA '03, Proceedings of the 2003 International Conference on Parallel and Distributed Processing Techniques and Applications (H. R. Arabnia and Y. Man, eds.), vol. 1, (Las Vegas, NV), pp. 215--219, June 2003.]]Google ScholarGoogle Scholar
  26. A. Carmona, L. Domingo, R. Macau, R. Puigjaner, and F. Rojo, "Performance experiences of the Barcelona Olympic games computer system," in Computer Performance Evaluation, Modeling Techniques and Tools (G. Haring and G. Kotsis, eds.), vol. 794 of Lecture Notes in Computer Science, pp. 52--75, Springer, 1994.]] Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Expressing performance requirements using regular expressions to specify stochastic probes over process algebra models
    Index terms have been assigned to the content through auto-classification.

    Recommendations

    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