Belief Bisimulation for Hidden Markov Models Logical Characterisation and Decision Algorithm

Publication: Research - peer-reviewArticle in proceedings – Annual report year: 2012

NullPointerException

View graph of relations

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.
Original languageEnglish
TitleNASA Formal Methods : 4th International Symposium, NFM 2012, Norfolk, VA, USA, April 3-5, 2012. Proceedings
PublisherSpringer
Publication date2012
Pages326-340
ISBN (print)978-3-642-28890-6
ISBN (electronic)978-3-642-28891-3
DOIs
StatePublished

Conference

Conference4th NASA Formal Methods Symposium (NFM 2012)
CountryUnited States
CityNorfolk, Virginia
Period03/04/1205/04/12
Internet addresshttp://shemesh.larc.nasa.gov/nfm2012/
NameLecture Notes in Computer Science
Volume7226
ISSN (Print)0302-9743
CitationsWeb of Science® Times Cited: No match on DOI
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

ID: 51174877