Skip to main content
SpringerLink
Log in

Scaling down discrete-event simulation models

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

In the paper, a technique for automated rebuilding simulation models (including their program codes) to abstract from certain properties of the object being modeled is suggested. It reduces computational complexity of simulation modeling experiments. The suggested technique is applied to simulation models of distributed computer systems.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Smeliansky, R.L., On an Invariant of Program Behavior, Vestn. Mosk. Univ., Ser. 15, 1990, vol. 4.

  2. Chung, C.A., Simulation Modeling Handbook—A Practical Approach, CRC, 2004.

  3. Dinamika system s diskretnymi sobytiyami (Dynamics of Systems with Discrete Events), Mir, 1989.

  4. Bruns, G.R., Process Abstraction in the Verification of Temporal Properties, PhD Dissertation, University of Edinburgh, 1997.

  5. Bakhmurov, A., Kapitonova, A., and Smeliansky, R., DYANA: An Environment for Embedded System Design and Analysis, Proc. of 32nd Annu. Simulation Symp., San Diego, 1999.

  6. Ferrante, J., Ottenstein, K.J., and Warren, J.D., The Program Dependence Graph and Its Use in Optimization, ACM Trans. Programming Languages Systems, 1987, vol. 9, pp. 319–349.

    Article  MATH  Google Scholar 

  7. Binkley, D. and Gallagher, K., A Survey of Program Slicing, in Advances Computers, Academic, 1996.

  8. Smeliansky, R.L., et al., Construction of Models of Processors for Digital Processing of Signals on the Basis of Static-Dynamic Approach, Proc. of the 1st Int. Conf. “Digital Signal Processing and Its Applications, (Moscow, 1998), Moscow: MTsNTI; vol. 4, pp. 147–151; http://lvk.cs.msu.su/materials/san2.doc.

  9. Savenkov, K.O. and Yushchenko, N.V., Technique of Processor Behavior Description for Estimating Program Implementation Time, Tr. Vseross. nauchn. konf. “Metody i sredstva obrabotki informatsii” (Proc. of All-Russia Scientific Conf. “Methods and Means of Information Processing”), Moscow: Mosk. Gos. Univ., 2003, pp. 486–491; http://lvk.cs.msu.su/materials/11.doc.

    Google Scholar 

  10. Molonov, V.G. and Smeliansky, R.L., Complex Approach to Modeling Distributed Computing Systems, Programmirovanie, 1987, no. 6.

  11. Smeliansky, R.L., Mathematical Model of Functioning of Distributed Computing Systems, Vestn. Mosk. Univ., Ser. 15, 1990, vol. 3.

  12. Ershov, A.P., State of the Art of the Theory of Program Schemes), Problemy kibern., 1973, vol. 27, pp. 87–110.

    MATH  Google Scholar 

  13. Cheng, J., Slicing Concurrent Programs—A Graph-Theoretical Approach, in Automated and Algorithmic Debugging, 1993, pp. 223–240; citeseer.ist.psu.edu/cheng93slicing.html.

  14. Weiser, M., Program Slicing, IEEE Trans. Software Engineering, 1984, vol. 10, no. 4, pp. 352–357.

    Article  MATH  Google Scholar 

  15. Groote, J.F., The Syntax and Semantics of Timed CRL, Centrum voor Wiskunde en Informatica (CWI), 1997; citeseer.ist.psu.edu/groote97syn-tax.html.

  16. Harrold, M.J. and Rothermel, G., Syntax-directed Construction of Program Dependence Graphs, Tech. Report OSU-CISRC-5/96-TR32, The Ohio State University, 1996; citeseer.ist.psu.edu/152209.html.

  17. Snelting, G., Robschink, T., and Krinke, J., Efficient Path Conditions in Dependence Graphs for Software Safety Analysis, citeseer.ist.psu.edu/630759.html.

  18. Mueler-Olm, M. and Seidl, H., On Optimal Slicing of Parallel Programs, Proc. of the 33th ACM Symp. on Theory of Computing, 2001, pp. 647–656, citeseer.ist.psu.edu/502699.html.

  19. Reps, T., Program Analysis Via Graph Reachability. TR-1386. Computer Sciences Department, Madison, 1998, http://www.cs.wisc.edu/wpis/papers/tr1386.pdf.

    Google Scholar 

  20. Bakhmurov, A.G., Kostenko, V.A., and Smeliansky, R.L., Modeling Environment DYANA: Synthesis, Analysis and Optimization of Computational Systems, Tezisy dokladov Vseross. nauchn. konf. “Fundamental’nye i prikladnye aspekty razrabotki bol’shikh raspredelennykh programmnykh kompleksov”, (Abstracts of the All-Russia Scientific Conf. “Fundamental and Applied Aspects of the Development of Large Distributed Program Complexes”), Novorossiisk, 1998, pp. 28–34, http://lvk.cs.msu.su/materials/san3.doc.

  21. Smeliansky, R.L., et al., A Technique for Estimating Execution Time of Programs Optimized for a Concrete Process Architecture by Using Program Text on a High-Level Language, Sbornik dokladov 1-oi mezhdunarodnoi konf. “Tsifrovaya obrabotka signalov i ee primeneniya” (Proc. of the 1st Int. Conf. “Digital Signal Processing and its Applications”), Moscow: MTsNTI, 1998, vol. 4, pp. 203–220, http://lvk.cs.msu.su/materials/san1.doc.

    Google Scholar 

  22. Smeliansky, R.L., Analysis of Performance of Distributed Microprocessor Computing Systems Based on a Program Behavior Invariant, Doctoral (Phys.-Math.) Dissertation, Moscow: Moscow State University, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computational Mathematics and Cybernetics, Moscow State University, Leninskie gory, Moscow, 119992, Russia

    K. O. Savenkov & R. L. Smeliansky

Authors
  1. K. O. Savenkov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. L. Smeliansky
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © K.O. Savenkov, R.L. Smeliansky, 2006, published in Programmirovanie, 2006, Vol. 32, No. 6.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Savenkov, K.O., Smeliansky, R.L. Scaling down discrete-event simulation models. Program Comput Soft 32, 308–316 (2006). https://doi.org/10.1134/S036176880606003X

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S036176880606003X

Keywords

Search

Navigation