{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:11:25Z","timestamp":1774987885342,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642288906","type":"print"},{"value":"9783642288913","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28891-3_22","type":"book-chapter","created":{"date-parts":[[2012,3,30]],"date-time":"2012-03-30T08:53:01Z","timestamp":1333097581000},"page":"216-230","source":"Crossref","is-referenced-by-count":13,"title":["Learning Markov Models for Stationary System Behaviors"],"prefix":"10.1007","author":[{"given":"Yingke","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hua","family":"Mao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manfred","family":"Jaeger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas Dyhre","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim","family":"Guldstrand Larsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brian","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking. The MIT Press (2008)"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-58473-0_144","volume-title":"Grammatical Inference and Applications","author":"R. Carrasco","year":"1994","unstructured":"Carrasco, R., Oncina, J.: Learning Stochastic Regular Grammars by Means of a State Merging Method. In: Carrasco, R.C., Oncina, J. (eds.) ICGI 1994. LNCS, vol.\u00a0862, pp. 139\u2013152. Springer, Heidelberg (1994)"},{"issue":"3","key":"22_CR3","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1109\/TIT.2005.864431","volume":"52","author":"I. Csisz\u00e1r","year":"2006","unstructured":"Csisz\u00e1r, I., Talata, Z.: Context tree estimation for not necessarily finite memory processes, via BIC and MDL. IEEE Transactions on Information Theory\u00a052(3), 1007\u20131016 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"22_CR4","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0020-0190(90)90107-9","volume":"35","author":"T. Herman","year":"1990","unstructured":"Herman, T.: Probabilistic self-stabilization. Information Processing Letters\u00a035(2), 63\u201367 (1990)","journal-title":"Information Processing Letters"},{"key":"22_CR5","unstructured":"Knuth, D., Yao, A.: The complexity of nonuniform random number generation. In: Algorithms and Complexity: New Directions and Recent Results. Academic Press (1976)"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-642-22110-1_47","volume-title":"Computer Aided Verification","author":"M. Kwiatkowska","year":"2011","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: PRISM 4.0: Verification of Probabilistic Real-Time Systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol.\u00a06806, pp. 585\u2013591. Springer, Heidelberg (2011)"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Legay, A., Delahaye, B.: Statistical model checking: An overview. CoRR, abs\/1005.1327 (2010)","DOI":"10.1007\/978-3-642-16612-9_11"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Mao, H., Chen, Y., Jaeger, M., Nielsen, T., Larsen, K., Nielsen, B.: Learning probabilistic automata for model checking. In: 2011 Eighth International Conference on Quantitative Evaluation of Systems, pp. 111\u2013120 (September 2011)","DOI":"10.1109\/QEST.2011.21"},{"issue":"5","key":"22_CR9","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J. Rissanen","year":"1978","unstructured":"Rissanen, J.: Modeling by shortest data description. Automatica\u00a014(5), 465\u2013471 (1978)","journal-title":"Automatica"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1023\/A:1026490906255","volume":"25","author":"D. Ron","year":"1996","unstructured":"Ron, D., Singer, Y., Tishby, N.: Power of amnesia: Learning probabilistic automata with variable memory length. Machine Learning\u00a025, 117\u2013149 (1996)","journal-title":"Machine Learning"},{"issue":"2","key":"22_CR11","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1214\/aos\/1176344136","volume":"6","author":"G. Schwarz","year":"1978","unstructured":"Schwarz, G.: Estimating the dimension of a model. The Annals of Statistics\u00a06(2), 461\u2013464 (1978)","journal-title":"The Annals of Statistics"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Sen, K., Viswanathan, M., Agha, G.: Learning continuous time markov chains from sample executions. In: International Conference on Quantitative Evaluation of Systems, pp. 146\u2013155 (2004)","DOI":"10.1109\/QEST.2004.1348029"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-540-27813-9_16","volume-title":"Computer Aided Verification","author":"K. Sen","year":"2004","unstructured":"Sen, K., Viswanathan, M., Agha, G.: Statistical Model Checking of Black-Box Probabilistic Systems. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol.\u00a03114, pp. 202\u2013215. Springer, Heidelberg (2004)"},{"key":"22_CR14","unstructured":"Tan, P.-N., Steinbach, M., Kumar, V.: Introduction to Data Mining. Addison Wesley (2006)"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-45657-0_17","volume-title":"Computer Aided Verification","author":"H.L.S. Younes","year":"2002","unstructured":"Younes, H.L.S., Simmons, R.G.: Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 223\u2013235. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28891-3_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:14:17Z","timestamp":1620112457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28891-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642288906","9783642288913"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28891-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}