We explore the concept of a "black-box" stochastic system, and propose an algorithm for verifying probabilistic properties of such systems based on very weak assumptions regarding system dynamics. Properties are expressed as formulae in a probabilistic temporal logic. Our presentation is a generalization of and an improvement over recent work by Sen et al. on probabilistic verification for "black-box" systems. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Younes, H. L. S. (2005). Probabilistic verification for “black-box” systems. In Lecture Notes in Computer Science (Vol. 3576, pp. 253–265). Springer Verlag. https://doi.org/10.1007/11513988_25
Mendeley helps you to discover research relevant for your work.