Abstract
In this chapter, the authors provide the formalization of extended DTMC models, namely Hidden Markov Models (HMMs), which are the core concept for formally evaluating the probability of the occurrence of a particular observed sequence and finding the best state sequence to generate given observation (Mantyla & Tutkimuskeskus, 2001; Rabiner, 1990). In order to present the usefulness of the formalization of HMM and the formal verification of HMM properties, the authors illustrate the formal analysis of a DNA (Deoxyribon Nucleic Acid) sequence at the end of the chapter.
Reference5 articles.
1. What is a hidden Markov model?
2. Liu, L. (2013). Formalization of discrete-time Markov chains in HOL. (PhD thesis). Concordia University, Montreal, Canada.
3. Liu, L., Aravantinos, V., Hasan, O., & Tahar, S. (2014). On the formal analysis of HMM using theorem proving. In Formal engineering methods (LNCS), (vol. 8829, pp. 316-331). Berlin: Springer.
4. A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition