Formalization of Finite-State Discrete-Time Markov Chains in HOL

The mathematical concept of Markov chains is widely used to model and analyze many engineering and scientific problems. Markovian models are usually analyzed using computer simulation, and more recently using probabilistic model-checking but these methods either do not guarantee accurate analysis or are not scalable. As an alternative, we propose to use higher-order-logic theorem proving to reason about properties of systems that can be described as Markov chains. As the first step towards this goal, this paper presents a formalization of time homogeneous finite-state Discrete-time Markov chains and the formal verification of some of their fundamental properties, such as Joint probabilities, Chapman-Kolmogorov equation and steady state probabilities, using the HOL theorem prover. For illustration purposes, we utilize our formalization to analyze a simplified binary communication channel.

[1]  Christel Baier,et al.  Principles of Model Checking (Representation and Mind Series) , 2008 .

[2]  Michael I. Jordan.  Learning in Graphical Models , 1999, NATO ASI Series.

[3]  Sofiène Tahar,et al.  Formal Reasoning about Expectation Properties for Continuous Random Variables , 2009, FM.

[4]  Osman Hasan,et al.  Formal probabilistic analysis using theorem proving , 2008 .

[5]  Sofiène Tahar,et al.  Reasoning about conditional probabilities in a higher-order-logic theorem prover , 2011, J. Appl. Log..

[6]  Peter J. Haas,et al.  Stochastic Petri Nets , 2002 .

[7]  William J. Stewart,et al.  Introduction to the numerical solution of Markov Chains , 1994 .

[8]  Michael Sczittnick,et al.  MACOM - A Tool for Evaluating Communication Systems , 1997, MMB.

[9]  Graham Birtwistle,et al.  Current Trends in Hardware Verification and Automated Theorem Proving , 1989, Springer New York.

[10]  Mahesh Viswanathan,et al.  VESTA: A statistical model-checker and analyzer for probabilistic systems , 2005, Second International Conference on the Quantitative Evaluation of Systems (QEST'05).

[11]  Ana Cavalcanti,et al.  FM 2009: Formal Methods, Second World Congress, Eindhoven, The Netherlands, November 2-6, 2009. Proceedings , 2009, FM.

[12]  Kishor S. Trivedi,et al.  SPNP: stochastic Petri net package , 1989, Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89.

[13]  Kishor S. Trivedi.  Probability and Statistics with Reliability, Queuing, and Computer Science Applications , 1984 .

[14]  David H. Jonassen,et al.  Task Analysis Methods for Instructional Design , 1998 .

[15]  William J. Knottenbelt,et al.  Generalised Markovian analysis of timed transition systems , 1996 .

[16]  Peter J. Haas,et al.  Stochastic Petri Nets: Modelling, Stability, Simulation , 2002 .

[17]  Christel Baier,et al.  Principles of model checking , 2008 .

[18]  H. Katzgraber.  Introduction to Monte Carlo Methods , 2009, 0905.1629.

[19]  David Anthony Parker,et al.  Implementation of symbolic model checking for probabilistic systems , 2003 .

[20]  I. G. MacKenzie,et al.  Stochastic Processes with Applications , 1992 .

[21]  Sofiène Tahar,et al.  On the Formalization of the Lebesgue Integration Theory in HOL , 2010, ITP.

[22]  Jan J. M. M. Rutten,et al.  Mathematical techniques for analyzing concurrent and probabilistic systems , 2004, CRM monograph series.

[23]  Joe Hurd,et al.  Formal verification of probabilistic algorithms , 2003 .

[24]  Zohar Manna,et al.  Formal verification of probabilistic systems , 1997 .

[25]  Michael J. C. Gordon,et al.  Mechanizing programming logics in higher order logic , 1989 .

[26]  Christel Baier,et al.  Model-Checking Algorithms for Continuous-Time Markov Chains , 2002, IEEE Trans. Software Eng..

[27]  Peter G. Harrison,et al.  HYDRA: HYpergraph-Based Distributed Response-Time Analyzer , 2003, PDPTA.