{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T01:18:59Z","timestamp":1725671939618},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642288906"},{"type":"electronic","value":"9783642288913"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28891-3_31","type":"book-chapter","created":{"date-parts":[[2012,3,30]],"date-time":"2012-03-30T08:53:01Z","timestamp":1333097581000},"page":"326-340","source":"Crossref","is-referenced-by-count":3,"title":["Belief Bisimulation for Hidden Markov Models"],"prefix":"10.1007","author":[{"given":"David N.","family":"Jansen","sequence":"first","affiliation":[]},{"given":"Flemming","family":"Nielson","sequence":"additional","affiliation":[]},{"given":"Lijun","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","volume-title":"Principles of model checking","author":"C. Baier","year":"2008","unstructured":"Baier, C., Katoen, J.-P.: Principles of model checking. MIT Press, Cambridge (2008)"},{"issue":"2","key":"31_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.ic.2005.03.001","volume":"200","author":"C. Baier","year":"2005","unstructured":"Baier, C., Katoen, J.-P., Hermanns, H., Wolf, V.: Comparative branching-time semantics for Markov chains. Inf. Comput.\u00a0200(2), 149\u2013214 (2005)","journal-title":"Inf. Comput."},{"key":"31_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/3-540-44745-8_6","volume-title":"Energy Minimization Methods in Computer Vision and Pattern Recognition","author":"M. Bicego","year":"2001","unstructured":"Bicego, M., Dovier, A., Murino, V.: Designing the Minimal Structure of Hidden Markov Model by Bisimulation. In: Figueiredo, M., Zerubia, J., Jain, A.K. (eds.) EMMCVPR 2001. LNCS, vol.\u00a02134, pp. 75\u201390. Springer, Heidelberg (2001)"},{"key":"31_CR4","first-page":"1653","volume-title":"Proc. of the Twenty-First Intl. Joint Conference on Artificial Intelligence, IJCAI-2009","author":"P.S. Castro","year":"2009","unstructured":"Castro, P.S., Panangaden, P., Precup, D.: Equivalence relations in fully and partially observable Markov decision processes. In: Boutilier, C. (ed.) Proc. of the Twenty-First Intl. Joint Conference on Artificial Intelligence, IJCAI-2009, pp. 1653\u20131658. AAAI Press, Menlo Park (2009)"},{"issue":"4-6","key":"31_CR5","first-page":"449","volume":"10","author":"H. Christiansen","year":"2010","unstructured":"Christiansen, H., Have, C.T., Lassen, O.T., Petit, M.: Inference with constrained hidden Markov models in PRISM. TPLP\u00a010(4-6), 449\u2013464 (2010)","journal-title":"TPLP"},{"issue":"6","key":"31_CR6","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S0020-0190(03)00343-0","volume":"87","author":"S. Derisavi","year":"2003","unstructured":"Derisavi, S., Hermanns, H., Sanders, W.H.: Optimal state-space lumping in Markov chains. Inf. Proc. Lett.\u00a087(6), 309\u2013315 (2003)","journal-title":"Inf. Proc. Lett."},{"issue":"3","key":"31_CR7","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1142\/S0129054108005814","volume":"19","author":"L. Doyen","year":"2008","unstructured":"Doyen, L., Henzinger, T.A., Raskin, J.F.: Equivalence of labeled Markov chains. Int. J. Foundations of Computer Science\u00a019(3), 549\u2013563 (2008)","journal-title":"Int. J. Foundations of Computer Science"},{"issue":"5","key":"31_CR8","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/BF01211866","volume":"6","author":"H. Hansson","year":"1994","unstructured":"Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Asp. Comput.\u00a06(5), 512\u2013535 (1994)","journal-title":"Formal Asp. Comput."},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Jansen, D.N., Nielson, F., Zhang, L.: Belief bisimulation for hidden Markov models: logical characterisation and decision algorithm. Tech. Rep. ICIS-R12002, Radboud Universiteit: ICIS, Nijmegen (2012)","DOI":"10.1007\/978-3-642-28891-3_31"},{"key":"31_CR10","volume-title":"Speech and language processing: an introduction to natural language processing, computational linguistics, and speech recognition","author":"D. Jurafsky","year":"2000","unstructured":"Jurafsky, D., Martin, J.H.: Speech and language processing: an introduction to natural language processing, computational linguistics, and speech recognition. Prentice Hall, Upper Saddle River (2000)"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-71209-1_9","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J.-P. Katoen","year":"2007","unstructured":"Katoen, J.-P., Kemna, T., Zapreev, I., Jansen, D.N.: Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, pp. 87\u2013101. Springer, Heidelberg (2007)"},{"key":"31_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/978-3-642-22110-1_42","volume-title":"Computer Aided Verification","author":"S. Kiefer","year":"2011","unstructured":"Kiefer, S., Murawski, A.S., Ouaknine, J., Wachter, B., Worrell, J.: Language Equivalence for Probabilistic Automata. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol.\u00a06806, pp. 526\u2013540. Springer, Heidelberg (2011)"},{"issue":"1","key":"31_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K.G. Larsen","year":"1991","unstructured":"Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Inf. Comput.\u00a094(1), 1\u201328 (1991)","journal-title":"Inf. Comput."},{"issue":"6","key":"31_CR14","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput.\u00a016(6), 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"31_CR15","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/5.18626","volume":"77","author":"L.R. Rabiner","year":"1989","unstructured":"Rabiner, L.R.: A tutorial on hidden Markov models and selected applications in speech recognition. Proc. IEEE\u00a077(2), 257\u2013286 (1989)","journal-title":"Proc. IEEE"},{"key":"31_CR16","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/378420.378439","volume-title":"Proc. 2001 ACM SIGMETRICS Intl. Conf. on Measurement and Modeling of Computer Systems","author":"K. Salamatian","year":"2001","unstructured":"Salamatian, K., Vaton, S.: Hidden Markov modeling for network communication channels. In: Proc. 2001 ACM SIGMETRICS Intl. Conf. on Measurement and Modeling of Computer Systems, vol.\u00a029, pp. 92\u2013101. ACM, New York (2001)"},{"key":"31_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1007\/978-3-642-22110-1_58","volume-title":"Computer Aided Verification","author":"A.P. Sistla","year":"2011","unstructured":"Sistla, A.P., \u017defran, M., Feng, Y.: Monitorability of Stochastic Dynamical Systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol.\u00a06806, pp. 720\u2013736. Springer, Heidelberg (2011)"},{"key":"31_CR18","doi-asserted-by":"crossref","DOI":"10.1515\/9781400835560","volume-title":"Real analysis: measure theory, integration, and Hilbert spaces, Princeton lectures in analysis","author":"E.M. Stein","year":"2005","unstructured":"Stein, E.M., Shakarchi, R.: Real analysis: measure theory, integration, and Hilbert spaces, Princeton lectures in analysis, vol.\u00a0III. Princeton Univ. Pr., Princeton (2005)"},{"key":"31_CR19","volume-title":"The wrong kind of snow","author":"A. Woodward","year":"2007","unstructured":"Woodward, A., Penn, R.: The wrong kind of snow. Hodder & Stoughton, London (2007)"},{"key":"31_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/11562436_9","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2005","author":"L. Zhang","year":"2005","unstructured":"Zhang, L., Hermanns, H., Jansen, D.N.: Logic and Model Checking for Hidden Markov Models. In: Wang, F. (ed.) FORTE 2005. LNCS, vol.\u00a03731, pp. 98\u2013112. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28891-3_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T03:32:49Z","timestamp":1578540769000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28891-3_31"}},"subtitle":["Logical Characterisation and Decision Algorithm"],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642288906","9783642288913"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28891-3_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}