Many components of engineering systems exhibit random and uncertain behaviors that are normally distributed. In order to conduct the analysis of such systems within the trusted kernel of a higherorder- logic theorem prover, in this paper, we provide a higher-order-logic formalization of Lebesgue measure and Normal random variables along with the proof of their classical properties. To illustrate the usefulness of our formalization, we present a formal analysis of the probabilistic clock synchronization in wireless sensor networks.
CITATION STYLE
Qasim, M., Hasan, O., Elleuch, M., & Tahar, S. (2016). Formalization of normal random variables in HOL. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9791, pp. 44–59). Springer Verlag. https://doi.org/10.1007/978-3-319-42547-4_4
Mendeley helps you to discover research relevant for your work.