Formalization of Normal Random Variables
- M. Qasim, O. Hasa
san, M. Elleuch, S. Tahar
Hardware Verification Group ECE Department, Concordia University, Montreal, Canada
CICM M 16
July 28, 2016
Formalization of Normal Random Variables M. Qasim, O. Hasa san, M. - - PowerPoint PPT Presentation
Formalization of Normal Random Variables M. Qasim, O. Hasa san, M. Elleuch, S. Tahar Hardware Verification Group ECE Department, Concordia University, Montreal, Canada CICM M 16 July 28, 2016 Outline n Introduction and Motivation n
Hardware Verification Group ECE Department, Concordia University, Montreal, Canada
July 28, 2016
2 Formalization of Normal Random Variables
3 Formalization of Normal Random Variables
En Enviro vironme mental l Condit itio ions s Ag Agin ing Ph Phenome mena Unpre redict ictable le Inputs Inputs Noise ise
4 Formalization of Normal Random Variables
Hardware Software Syst System m Mo Model l Property Satisfied? Random Components Probabilistic and Statistical Properties Computer Based Analysis Framework
R andom ¡Variables (Discrete/ C ontinuous)
5 Formalization of Normal Random Variables
n Attain a countable number of values n Example
n Dice[1, 6]
n Attain an uncountable number of values n Examples
n Uniform (all real numbers in an interval [a,b])
6 Formalization of Normal Random Variables
Discre iscrete Contin inuous
Probability Mass Function (PMF) Probability that the random variable is equal to some number n Cumulative Distribution Function (CDF) Probability that the random variable is less than or equal to some number n Probability Density Function (PDF) Slope of CDF for continuous random variables
7 Formalization of Normal Random Variables
Pro Propert rty Descrip scriptio ion Illu llust stra ratio ion
Expectation Long-run average value of a random variable Variance Measure of dispersion of a random variable
8 Formalization of Normal Random Variables
Simu Simula latio ion Forma rmal l Me Methods Mo Model l Checkin cking Theore rem m Pro Provin ving Random m Comp mponents Probabilistic State Machine dgsd An Analysis lysis Accu Accura racy cy Exp Expre ressive ssiveness ss Au Automa matio ion Ma Maturit rity Approximate random variable functions Observing some test cases
Probabilistic State Machine Exhaustive Verification
Random variable functions Mathematical Reasoning
9 Formalization of Normal Random Variables
Syst System m Descrip scriptio ion
Syst System m Pro Propert rtie ies s (Discre iscrete Random m Va Varia riable les) s) Syst System m Pro Propert rtie ies s (Contin inuous Random m Va Varia riable les) s) System Model Probabilistic Analysis Proof Goals Discrete Random Variables Continuous Random Variables
Random Components Probabilistic Properties Statistical Properties PMF CDF Expectation Variance Probabilistic Properties Statistical Properties CDF PDF Expectation Variance
Theorem Prover Formal Proofs of Properties
Higher-order logic Formalization of Probability Theory
10 Formalization of Normal Random Variables
n Enormous Applications n Sample mean of most distributions can be
n PDF p(x) of a random variable x is used to define its
n The PDF of a random variable is formally defined as the
n RN derivative and probability measure was available in HOL4 n Lebesgue-Borel measure
n Ported from Isabelle/HOL [Hölzl, 2012] n Some theorems and tactics (e.g. SET_TAC) also ported from the Lebesgue
measure theory of HOL-Light [Harrison, 2013]
11 Formalization of Normal Random Variables
n The PDF of a random variable is formally defined as the
12 Formalization of Normal Random Variables
Definition: Probability Density Function
n X is a real random variable, i.e., it is measurable from the
n The distribution of X is that of the Normal random variable
13 Formalization of Normal Random Variables
Definition: Normal Random Variable
14 Formalization of Normal Random Variables
Theorem: PDF of a Normal random variable is non-negative Theorem: PDF over the whole space is 1
15 Formalization of Normal Random Variables
Theorem: PDF of a Normal random variable is symmetric around its mean Theorem: PDF of a Normal random variable is symmetric around its mean
16 Formalization of Normal Random Variables
Theorem: Summation of Normal Random Variables n The proofs of these properties not only ensure the correctness
n Randomness in
n Probabilistic bounds
n single hop n & multi-hop networks 17 Formalization of Normal Random Variables
18 Formalization of Normal Random Variables
Pairwise difference in packet reception time – Normally Distributed with mean = 0
S R1 R2 R3 R4 R5 R3 – R4
19 Formalization of Normal Random Variables
Theorem: Probability of synchronization error for single hop network
20 Formalization of Normal Random Variables
n Exact Answers n Useful for the analysis of Safety critical application
n Formalization of Probability Density Functions and
n Case Study
n Clock Synchronization in WSNs
n More Applications – Probabilistic Round off Error
21 Formalization of Normal Random Variables