Logic and model checking for hidden Markov models

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3731 LNCS, Issue , 2005, Pages 98-112

  Zhang, Lijun ^a   Hermanns, Holger ^a,b   Jansen, David N ^b  

^a SAARLAND UNIVERSITY   (Germany)

^b UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; DISCRETE TIME CONTROL SYSTEMS; LOGIC DESIGN; MATHEMATICAL MODELS; PROBABILITY; HIDDEN MARKOV MODELS; MARKOV PROCESSES;

CHECKING ALGORITHMS; HIDDEN MARKOV MODELS (HMM); PROBABILITY SYSTEMS; QUANTITATIVE PROPERTIES; BRANCHING TIME; DISCRETE TIME MARKOV CHAINS; HIDDEN MARKOV MODELS (HMMS); MODEL CHECKING ALGORITHM;

MARKOV PROCESSES; MODEL CHECKING;

EID: 33646387413     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11562436_9     Document Type: Conference Paper

References (25)

1. Suzana Andova, Holger Hermanns, and Joost-Pieter Katoen. Discrete-time rewards model-checked. In FORMATS, LNCS 2791:88-104. Springer, 2003.
2. G. Baier. On Algorithmic Verification Methods for Probabilistic Systems, 1998. Habilitations- schrift zur Erlangung der venia legendi der Fakultät für Mathematik and Informatik, Universität Mannheim.
3. C. Baier, B.R. Haverkort, H. Hermanns, and J.-P. Katoen. Efficient computation of time-bounded reachability probabilities in uniformized continuous-time Markov decision processes. In TACAS, LNCS 2988:61-76. Springer, 2004.
4. A. Bianco and L. de Alfaro. Model Checking of Probabilistic and Nondeterministic Systems. In FSTTCS, LNCS 1026:499-513. Springer, 1995.
5. E. Birney. Hidden Markov models in biological sequence analysis. IBM Journal of Research and Development, 45(3):449-454, 2001.
6. C. Courcoubetis and M. Yannakakis. Verifying Temporal Properties of FiniteState Probabilistic Programs. In FOCS:338-345. IEEE Computer Society Press, October 1988.
7. C. Courcoubetis and M. Yannakakis. The Complexity of Probabilistic Verification. Journal of the ACM, 42(4):857-907, 1995.
8. L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, 1997.
9. Technical report STAN-CS-TR-98-1601.
10. J.-M. Francois and G. Leduc. Mobility prediction's influence on QoS in wireless networks: A study on a call admission algorithm. In 3rd International Symposium on Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks, pages 238-247. IEEE Computer Society, 2005.
11. R. Gerth, D. Peled, M.Y. Vardi, and P. Wolper. Simple On-the-fly Automatic Verification of Linear Temporal Logic. In PSTV 38:3-18. Chapman &: Hall, 1995.
12. H. Hansson and B. Jonsson. A Logic for Reasoning about Time and Reliability. Formal Aspects of Computing, 6(5):512-535, 1994.
13. M. Hauskrecht. Value-Function Approximations for Partially Observable Markov Decision Processes. Journal of Artificial Intelligence Research, 13:33-94, 2000.
14. D. Jurafsky and J.H. Martin. Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition. Prentice Hall, 2000.
15. R. D. Nicola and F. W. Vaandrager. Action versus state based logics for transition systems. In Semantics of Systems of Concurrent Processes, LNCS 469:407-419. Springer, 1990.
16. P.A. Pevzner. Computational Molecular Biology: An Algorithmic Approach. The MIT Press, 2000.
17. P. Poupart. Approximate Value-Directed Belief State Monitoring for Partially Observable Markov Decision Processes. Master's thesis, University of British Columbia, November 2000.
18. L.R. Rabiner. A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition. Proceedings of the IEEE, 77(2):257-286, February 1989.
19. S. Safra. On the complexity of ω-automata. In FOC'5, pages 319-327, 1988.
20. S. Safra. Exponential determinization for ω-automata with strong-fairness acceptance condition. In STOC, pages 275-282, 1992.
21. K. Salamatian and S. Vaton. Hidden markov modeling for network communication channels. In SIGMETRICS, pages 92-101. ACM Press, 2001.
22. M. Y. Vardi and P. Wolper. An Automata-Theoretic Approach to Automatic Program Verification. In LICS, pages 332-345. IEEE Computer Society Press, June 1986.
23. J. A. Vlontzos and S. Y. Rung. Hidden Markov models for character recognition. IEEE Transactions on Image Processing, 1:539-543, October 1992.
24. P. Wolper, M. Y. Vardi, and A. P. Sistla. Reasoning about Infinite Computation Paths. In FOC5 '83, pages 185-194. IEEE Computer Society Press, 1982.
25. L. Zhang, H. Hermanns, and D. N. Jansen. Logic and Model Checking for Hidden Markov Chais. AVACS Technical Report No. 6, SFB/TR 14 AVACS, May 2005. ISSN: 1860-9821, http://www.avacs.org.