Three partition refinement algorithms
SIAM Journal on Computing
Bisimulation through probabilistic testing
Information and Computation
Hidden Markov modeling for network communication channels
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition
Designing the Minimal Structure of Hidden Markov Model by Bisimulation
EMMCVPR '01 Proceedings of the Third International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
Optimal state-space lumping in Markov chains
Information Processing Letters
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Equivalence relations in fully and partially observable Markov decision processes
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Comparative branching-time semantics for Markov chains
Information and Computation
Bisimulation minimisation mostly speeds up probabilistic model checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Inference with constrained hidden markov models in prism
Theory and Practice of Logic Programming
Language equivalence for probabilistic automata
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Monitorability of stochastic dynamical systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Logic and model checking for hidden markov models
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
| Hi-index | 0.00 |
This paper establishes connections between logical equivalences and bisimulation relations for hidden Markov models (HMM). Both standard and belief state bisimulations are considered. We also present decision algorithms for the bisimilarities. For standard bisimilarity, an extension of the usual partition refinement algorithm is enough. Belief bisimilarity, being a relation on the continuous space of belief states, cannot be described directly. Instead, we show how to generate a linear equation system in time cubic in the number of states.