Advertisement

Formal Reasoning about Classified Markov Chains in HOL

  • Liya Liu
  • Osman Hasan
  • Vincent Aravantinos
  • Sofiène Tahar
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7998)

Abstract

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.

Keywords

Markov Chain Model Check Formal Reasoning Page Fault Markovian System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Avi-Itzhak, B., Heyman, D.P.: Approximate Queuing Models for Multiprogramming Computer Systems. Operations Research 21(6), 1212–1230 (1973)zbMATHCrossRefGoogle Scholar
  2. 2.
    Baier, C., Katoen, J.: Principles of Model Checking. MIT Press (2008)Google Scholar
  3. 3.
    Bhattacharya, R.N., Waymire, E.C.: Stochastic Processes with Applications. John Wiley & Sons (1990)Google Scholar
  4. 4.
    Chung, K.L.: Markov chains with stationary transition probabilities. Springer (1960)Google Scholar
  5. 5.
    Häggström, O.: Finite Markov Chains and Algorithmic Applications. Cambridge University Press (2002)Google Scholar
  6. 6.
    Hasan, O.: Formal Probabilistic Analysis using Theorem Proving. PhD Thesis, Concordia University, Montreal, QC, Canada (2008)Google Scholar
  7. 7.
    Hasan, O., Tahar, S.: Reasoning about Conditional Probabilities in a Higher-Order-Logic Theorem Prover. Journal of Applied Logic 9(1), 23–40 (2011)MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Hölzl, J., Nipkow, T.: Interactive verification of markov chains: Two distributed protocol case studies. In: Quantities in Formal Methods, EPTCS, pp. 17–31 (2012)Google Scholar
  9. 9.
  10. 10.
    Liu, L., Hasan, O., Tahar, S.: Formalization of Finite-State Discrete-Time Markov Chains in HOL. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol. 6996, pp. 90–104. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  11. 11.
    Mhamdi, T.: Information-Theoretic Analysis using Theorem Proving. PhD Thesis, Concordia University, Montreal, QC, Canada (2012)Google Scholar
  12. 12.
    Mhamdi, T., Hasan, O., Tahar, S.: On the Formalization of the Lebesgue Integration Theory in HOL. In: Kaufmann, M., Paulson, L.C. (eds.) ITP 2010. LNCS, vol. 6172, pp. 387–402. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  13. 13.
    Norris, J.R.: Markov Chains. Cambridge University Press (1999)Google Scholar
  14. 14.
    Parker, D.A.: Implementation of Symbolic Model Checking for Probabilitics Systems. PhD Thesis, University of Birmingham, Birmingham, UK (2002)Google Scholar
  15. 15.
  16. 16.
    Sen, K., Viswanathan, M., Agha, G.: VESTA: A Statistical Model-Checker and Analyzer for Probabilistic Systems. In: IEEE International Conference on the Quantitative Evaluation of Systems, pp. 251–252 (2005)Google Scholar
  17. 17.
    Shedler, G., Tung, C.: Locality in page reference strings. SIAM Journal on Computing 1(3), 218–241 (1972)zbMATHCrossRefGoogle Scholar
  18. 18.
    Trivedi, K.S.: Probability and Statistics with Reliability, Queuing, and Computer Science Applications. John Wiley & Sons (2002)Google Scholar
  19. 19.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Liya Liu
    • 1
  • Osman Hasan
    • 1
  • Vincent Aravantinos
    • 1
  • Sofiène Tahar
    • 1
  1. 1.Dept. of Electrical & Computer EngineeringConcordia UniversityMontrealCanada

Personalised recommendations