Formal Reasoning about Classified Markov Chains in HOL

Classified Markov chains have been extensively applied to model and analyze various stochastic systems in many engineering and scientific domains. Traditionally, the analysis of these systems has been conducted using computer simulations and, more recently, also probabilistic model-checking. However, these methods either cannot guarantee accurate analysis or are not scalable due to the unacceptable computation times. As an alternative approach, this paper proposes to reason about classified Markov chains using HOL theorem proving. We provide a formalization of classified discrete-time Markov chains with finite state space in higher-order logic and the formal verification of some of their widely used properties. To illustrate the usefulness of the proposed approach, we present the formal analysis of a generic LRU (least recently used) stack model.

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

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

[3]  Tarek Mhamdi,et al.  Information-Theoretic Analysis using Theorem Proving , 2012 .

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

[5]  Kai Lai Chung,et al.  Markov Chains with Stationary Transition Probabilities , 1961 .

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

[7]  Olle Häggström.  Finite Markov Chains and Algorithmic Applications , 2002 .

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

[9]  Sofiène Tahar,et al.  Formalization of Finite-State Discrete-Time Markov Chains in HOL , 2011, ATVA.

[10]  D. Vere-Jones.  Markov Chains , 1972, Nature.

[11]  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).

[12]  Benjamin Avi-Itzhak,et al.  Approximate Queuing Models for Multiprogramming Computer Systems , 1973, Oper. Res..

[13]  Gerald S. Shedler,et al.  Locality in Page Reference Strings , 1972, SIAM J. Comput..

[14]  Mohamed Nassim Seghir,et al.  A Lightweight Approach for Loop Summarization , 2011, ATVA.

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

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

[17]  Johannes Hölzl,et al.  Interactive verification of Markov chains: Two distributed protocol case studies , 2012, QFM.

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