Skip to main content

Improving the Efficiency of the Proxel Method by Using Individual Time Steps

  • Conference paper
Analytical and Stochastic Modeling Techniques and Applications (ASMTA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5513))

  • 504 Accesses

Abstract

Discrete stochastic models (DSM) are widely used in various application fields today. Proxel-based simulation can outperform discrete event-based approaches in the analysis of small stiff DSM, which can occur for example in reliability modeling. However, when parallel processes with largely differing speed are involved, the faster process determines the small discretization time step, investing far too much effort into the approximation of the slower process. This paper relieves that problem by using individual time steps for each transition and situation. The key problem is to keep semantic consistency when using different time steps for parallel transitions. However, the preservation of the probability mass in every single simulation time step could be achieved. Experiments show that binary step division in conjunction with appropriate subdivision criteria can outperform the original Proxel method significantly. This increases the applicability of Proxels, by enabling the analysis of larger and therefore more realistic models.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Horton, G.: A new paradigm for the numerical simulation of stochastic petri nets with general firing times. In: Proceedings of the European Simulation Symposium 2002, pp. 129–136. SCS European Publishing House (2002)

    Google Scholar 

  2. Lazarova-Molnar, S.: The Proxel-Based Method: Formalisation, Analysis and Applications. PhD thesis, Otto-von-Guericke-University Magdeburg (2005)

    Google Scholar 

  3. Buchholz, R.: Improving the Efficiency of the Proxel Method by using Variable Time Steps. Master’s thesis, Otto-von-Guericke-University Magdeburg (2008)

    Google Scholar 

  4. German, R., Lindemann, C.: Analysis of stochastic petri nets by the method of supplementary variables. In: Proceedings of Performance Evaluation, vol. 20, pp. 317–335 (1994)

    Google Scholar 

  5. Bolch, G., Greiner, S., de Meer, H., Trivedi, K.S.: Queuing Networks and Markov Chains. John Wiley & Sons, New York (1998)

    Book  MATH  Google Scholar 

  6. Richardson, L.: The deferred approach to the limit. part i. single lattice. Philosophical Transactions of the Royal Society of London, Series A 226, 817–823 (1927)

    Article  Google Scholar 

  7. Wickborn, F., Horton, G.: Feasible state space simulation: Variable time steps for the proxel method. In: Proceedings of the 2nd Balkan Conference in Informatics, Ohrid, Macedonia, pp. 446–453 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Krull, C., Buchholz, R., Horton, G. (2009). Improving the Efficiency of the Proxel Method by Using Individual Time Steps. In: Al-Begain, K., Fiems, D., Horváth, G. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2009. Lecture Notes in Computer Science, vol 5513. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02205-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02205-0_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02204-3

  • Online ISBN: 978-3-642-02205-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics