Abstract
Markov chains are typical tools for modelling real stochastic processes. The present paper suggest to use an equivalent model of Iterative Probabilistic Algorithms, interpreted in a finite structure. The Probabilistic Algorithms model gives the possibility of modelling subprocesses and obtaining the algorithm modelling the whole process as an (algorithmic) composition of algorithms modelling subprocesses. The typical parametres (the transition matrix of the algorithm, average number of steps,… ) can be determined without experiments and compared to results of the statistical analysis of computer simulations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
5 References
Borowska A., “Implementation of Algorithm Determining Probabilities of Behaves Probabilistic Algorithms”, MSc thesis, Technical University of Białystok, Białystok 2002
Borowska A., “Determining of Probabilities of Transitions in the Probabilistic Algorithms”, MSc thesis, University of Białystok, Bialystok 1999
Borowska A., Dańko W., Karbowska-Chilińska J., “Probabilistic Algorithms as a Tool for Modelling Stochastic Processes”, Proceedings of the conference CISIM 2004, 14–16 June 2004, Ełk; Poland, vol I, pp 380–389.
Dańko W., “The Set of Probabilistic Algorithmic Formulas Valid in a Finite Structure is Decidable with Respect to its Diagram”, Fundamenta Informaticae, vol. 19(3–4), pp. 417–431, 1993
Feldman Y., Harell D., ”A probabilistic dynamic logic”, ACM Journal of Comp., 1982
Feller W., ”An Introduction to Probability Theory”, PWN, Warsaw 1977
Iosifescu M., “Finite Markov Processes and Their Applications”, John Wiley & Sons, New York, London 1988
Karbowska J., “Probabilistic Iterative Algorithms with Continuous Time Parameter”, Proceedings of the conference CISIM 2003, 26–28 June, 2003, Ełk; Poland, pp 133–140.
Koszelew J., “The Methods for Verification Properties of Probabilistic Programs”, Ph. D. thesis IPI PAN, Warsaw 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this paper
Cite this paper
Borowska, A., Dańko, W., Karbowska-Chilińska, J. (2005). Modelling using probabilistic algorithms. In: Saeed, K., Pejaś, J. (eds) Information Processing and Security Systems. Springer, Boston, MA. https://doi.org/10.1007/0-387-26325-X_29
Download citation
DOI: https://doi.org/10.1007/0-387-26325-X_29
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-25091-5
Online ISBN: 978-0-387-26325-0
eBook Packages: Computer ScienceComputer Science (R0)