{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:01:26Z","timestamp":1725465686938},"publisher-location":"New York","reference-count":9,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"0387250913"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/0-387-26325-x_29","type":"book-chapter","created":{"date-parts":[[2005,10,24]],"date-time":"2005-10-24T04:36:54Z","timestamp":1130128614000},"page":"303-315","source":"Crossref","is-referenced-by-count":0,"title":["Modelling using probabilistic algorithms"],"prefix":"10.1007","author":[{"given":"Anna","family":"Borowska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wiktor","family":"Da\u0144ko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joanna","family":"Karbowska-Chili\u0144ska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Borowska A., \u201cImplementation of Algorithm Determining Probabilities of Behaves Probabilistic Algorithms\u201d, MSc thesis, Technical University of Bia\u0142ystok, Bia\u0142ystok 2002","key":"29_CR1"},{"unstructured":"Borowska A., \u201cDetermining of Probabilities of Transitions in the Probabilistic Algorithms\u201d, MSc thesis, University of Bia\u0142ystok, Bialystok 1999","key":"29_CR2"},{"unstructured":"Borowska A., Da\u0144ko W., Karbowska-Chili\u0144ska J., \u201cProbabilistic Algorithms as a Tool for Modelling Stochastic Processes\u201d, Proceedings of the conference CISIM 2004, 14\u201316 June 2004, E\u0142k; Poland, vol I, pp 380\u2013389.","key":"29_CR3"},{"issue":"3\u20134","key":"29_CR4","doi-asserted-by":"crossref","first-page":"417","DOI":"10.3233\/FI-1993-193-411","volume":"19","author":"W. Da\u0144ko","year":"1993","unstructured":"Da\u0144ko W., \u201cThe Set of Probabilistic Algorithmic Formulas Valid in a Finite Structure is Decidable with Respect to its Diagram\u201d, Fundamenta Informaticae, vol. 19(3\u20134), pp. 417\u2013431, 1993","journal-title":"Fundamenta Informaticae"},{"doi-asserted-by":"crossref","unstructured":"Feldman Y., Harell D., \u201dA probabilistic dynamic logic\u201d, ACM Journal of Comp., 1982","key":"29_CR5","DOI":"10.1145\/800070.802191"},{"key":"29_CR6","volume-title":"An Introduction to Probability Theory","author":"W. Feller","year":"1977","unstructured":"Feller W., \u201dAn Introduction to Probability Theory\u201d, PWN, Warsaw 1977"},{"key":"29_CR7","volume-title":"Finite Markov Processes and Their Applications","author":"M. Iosifescu","year":"1988","unstructured":"Iosifescu M., \u201cFinite Markov Processes and Their Applications\u201d, John Wiley & Sons, New York, London 1988"},{"unstructured":"Karbowska J., \u201cProbabilistic Iterative Algorithms with Continuous Time Parameter\u201d, Proceedings of the conference CISIM 2003, 26\u201328 June, 2003, E\u0142k; Poland, pp 133\u2013140.","key":"29_CR8"},{"unstructured":"Koszelew J., \u201cThe Methods for Verification Properties of Probabilistic Programs\u201d, Ph. D. thesis IPI PAN, Warsaw 2000.","key":"29_CR9"}],"container-title":["Information Processing and Security Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-26325-X_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T20:29:53Z","timestamp":1626640193000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-26325-X_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387250913"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/0-387-26325-x_29","relation":{},"subject":[]}}