Skip to main content
SpringerLink
Log in
Book cover

International Conference on Modelling Techniques and Tools for Computer Performance Evaluation

TOOLS 2002: Computer Performance Evaluation: Modelling Techniques and Tools pp 178–187Cite as

A Passage-Time Preserving Equivalence for Semi-Markov Processes

  • Conference paper
  • First Online:

  • 701 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2324))

Abstract

An equivalence for semi-Markov processes is presented which preserves passage-time distributions between pairs of states in a given set. The equivalence is based upon a state-based aggregation procedure which is O(n 2) per state in the worst case.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. G. Kemeny and J. L. Snell, Finite Markov Chains. Van Nostrand, 1960.

    Google Scholar 

  2. H. Hermanns and M. Rettelbach, “Syntax, semantics, equivalences, and axioms for MTIPP,” in Process Algebra and Performance Modelling Workshop (U. Herzog and M. Rettelbach, eds.), pp. 69–88, Arbeitsberichte des IMMD, Universtät Erlangen-Nürnberg, Regensberg, July 1994.

    Google Scholar 

  3. 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 Scholar 

  4. H. Hermanns, Interactive Markov Chains. PhD thesis, Universität Erlangen-Nürnberg, July 1998.

    Google Scholar 

  5. M. Bernardo and R. Gorrieri, “Extended Markovian Process Algebra,” in CONCUR’96, Proceedings of the 7th International Conference on Concurrency Theory (U. Montanari and V. Sassone, eds.), vol. 1119 of Lecture Notes in Computer Science, pp. 315–330, Springer-Verlag, Pisa, August 1996.

    Google Scholar 

  6. R. Pyke “Markov renewal processes with finitely many states,” Annals of Mathematical Statistics, vol. 32, pp. 1243–1259, December 1961.

    Google Scholar 

  7. J. T. Bradley and N. J. Davies, “A matrix-based method for analysing stochastic process algebras,” in ICALP Workshops 2000, Process Algebra and Performance Modelling Workshop (J. D. P. Rolim, ed.), pp. 579–590, University of Waterloo, Ontario, Canada, Carleton Scientific, Geneva, July 2000.

    Google Scholar 

  8. J. Abate and W. Whitt, “The Fourier-series method for inverting transforms of probability distributions,” Queueing Systems, vol. 10, no. 1, pp. 5–88, 1992.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing, Imperial College of Science, Technology and Medicine, Huxley Building, 180 Queen’s Gate, London, SW7 2BZ

    J. T. Bradley

Authors
  1. J. T. Bradley
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing, Imperial College of Science, Technology, and Medicine, Huxley Building, 180 Queen’s Gate, London, SW7 2BZ, UK

    Tony Field , Peter G. Harrison  & Jeremy Bradley ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bradley, J.T. (2002). A Passage-Time Preserving Equivalence for Semi-Markov Processes. In: Field, T., Harrison, P.G., Bradley, J., Harder, U. (eds) Computer Performance Evaluation: Modelling Techniques and Tools. TOOLS 2002. Lecture Notes in Computer Science, vol 2324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46029-2_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-46029-2_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43539-6

  • Online ISBN: 978-3-540-46029-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation