Discrete-Time Markov Chains in HOL
Keyword(s):
In this chapter, the authors describe the formalization of discrete-time Markov chains and the formal verification of some of its most important properties using the probability theory presented in the last chapter. In order to illustrate the usefulness of this work, a binary communication channel model and a collection process model involved in the Automatic Mail Quality Measurement (AMQM) protocol are formally analyzed in HOL.
Keyword(s):
1992 ◽
Vol 10
(3)
◽
pp. 139-154
◽
2007 ◽
Vol 39
(02)
◽
pp. 360-384
◽
Keyword(s):
Keyword(s):
1990 ◽
Vol 9
(5)
◽
pp. 305-313
◽
2010 ◽
Vol 347
(5)
◽
pp. 795-805
◽