Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baier, C., Haverkort, B., Hermanns, H., Katoen, J.P.: Model Checking Algorithms for Continuous time Markov Chains. IEEE Transactions on Software Engineering 29(4), 524–541 (2003)
Baier, C., Katoen, J.: Principles of Model Checking. MIT Press, Cambridge (2008)
Bhattacharya, R.N., Waymire, E.C.: Stochastic Processes with Applications. John Wiley & Sons, Chichester (1990)
Ciardo, G., Muppala, J.K., Trivedi, K.S.: SPNP: Stochastic Petri Net Package. In: Workshop on Petri Nets and Performance Models, pp. 142–151 (1989)
de Alfaro, L.: Formal Verification of Probabilistic Systems. PhD Thesis, Stanford University, Stanford, USA (1997)
Dingle, N.J., Knottenbelt, W.J., Harrison, P.G.: HYDRA - Hypergraph-based Distributed Response-time Analyser. In: International Conference on Parallel and Distributed Processing Technique and Applications, pp. 215–219 (2003)
Gordon, M.J.C.: Mechanizing Programming Logics in Higher-0rder Logic. In: Current Trends in Hardware Verification and Automated Theorem Proving, pp. 387–439. Springer, Heidelberg (1989)
GreatSPN (2011), http://www.di.unito.it/~greatspn/index.html
Haas, P.J.: Stochastic Petri Nets: Modelling, Stability, Simulation. Springer, Heidelberg (2002)
Hasan, O.: Formal Probabilistic Analysis using Theorem Proving. PhD Thesis, Concordia University, Montreal, QC, Canada (2008)
Hasan, O., Abbasi, N., Akbarpour, B., Tahar, S., Akbarpour, R.: Formal Reasoning about Expectation Properties for Continuous Random Variables. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol. 5850, pp. 435–450. Springer, Heidelberg (2009)
Hasan, O., Tahar, S.: Reasoning about Conditional Probabilities in a Higher-Order-Logic Theorem Prover. Journal of Applied Logic 9(1), 23–40 (2011)
Hurd, J.: Formal Verification of Probabilistic Algorithms. PhD Thesis, University of Cambridge, UK (2002)
Jonassen, D.H., Tessmer, M., Hannum, W.H.: Task Analysis Methods for Instructional Design. Lawrence Erlbaum, Mahwah (1999)
Knottenbelt, W.J.: Generalised Markovian Analysis of Timed Transition Systems. Master’s thesis, Department of Computer Science, University of Cape Town, South Africa (1996)
MacKay, D.J.C.: Introduction to Monte Carlo Methods. In: Learning in Graphical Models. NATO Science Series, pp. 175–204. Kluwer Academic Press, Dordrecht (1998)
MARCA (2011), http://www4.ncsu.edu/~billy/marca/marca.html
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)
Mobius (2011), http://www.mobius.illinois.edu/
Parker, D.: Implementation of Symbolic Model Checking for Probabilistic System. PhD Thesis, University of Birmingham, UK (2001)
PEPA (2011), http://www.dcs.ed.ac.uk/pepa/
PRISM (2011), http://www.prismmodelchecker.org/
RELEX (2011), http://www.ptc.com/products/relex/markov
Rutten, J., Kwaiatkowska, M., Normal, G., Parker, D.: Mathematical Techniques for Analyzing Concurrent and Probabilisitc Systems. CRM Monograph Series, vol. 23. American Mathematical Society, Providence (2004)
Sczittnick, M.: MACOM - A Tool for Evaluating Communication Systems. In: International Conference on Modelling Techniques and Tools for Computer Performance Evaluation, pp. 7–10 (1994)
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)
Steward, W.J.: Introduction to the Numerical Solution of Markov Chain. Princeton University Press, Princeton (1994)
Trivedi, K.S.: Probability and Statistics with Reliability, Queuing, and Computer Science Applications. John Wiley & Sons, Chichester (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, L., Hasan, O., Tahar, S. (2011). Formalization of Finite-State Discrete-Time Markov Chains in HOL. In: Bultan, T., Hsiung, PA. (eds) Automated Technology for Verification and Analysis. ATVA 2011. Lecture Notes in Computer Science, vol 6996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24372-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-24372-1_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24371-4
Online ISBN: 978-3-642-24372-1
eBook Packages: Computer ScienceComputer Science (R0)