{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,12]],"date-time":"2026-09-12T01:34:23Z","timestamp":1789176863628,"version":"build-2803163510"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642243714","type":"print"},{"value":"9783642243721","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24372-1_40","type":"book-chapter","created":{"date-parts":[[2011,9,29]],"date-time":"2011-09-29T05:41:14Z","timestamp":1317274874000},"page":"511-521","source":"Crossref","is-referenced-by-count":23,"title":["Learning-Based Compositional Verification for Synchronous Probabilistic Systems"],"prefix":"10.1007","author":[{"given":"Lu","family":"Feng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tingting","family":"Han","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marta","family":"Kwiatkowska","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Parker","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"40_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-44685-0_24","volume-title":"CONCUR 2001 - Concurrency Theory","author":"L. Alfaro de","year":"2001","unstructured":"de Alfaro, L., Henzinger, T., Jhala, R.: Compositional methods for probabilistic systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, p. 351. Springer, Heidelberg (2001)"},{"issue":"2","key":"40_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation\u00a075(2), 87\u2013106 (1987)","journal-title":"Information and Computation"},{"key":"40_CR3","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":"6","key":"40_CR4","doi-asserted-by":"publisher","first-page":"1268","DOI":"10.1137\/S009753979326091X","volume":"25","author":"F. Bergadano","year":"1996","unstructured":"Bergadano, F., Varricchio, S.: Learning behaviors of automata from multiplicity and equivalence queries. SIAM J. Comput.\u00a025(6), 1268\u20131280 (1996)","journal-title":"SIAM J. Comput."},{"key":"40_CR5","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s00224-003-1061-2","volume":"36","author":"V. Blondel","year":"2001","unstructured":"Blondel, V., Canterini, V.: Undecidable problems for probabilistic automata of fixed dimension. Theory of Computing Systems\u00a036, 231\u2013245 (2001)","journal-title":"Theory of Computing Systems"},{"key":"40_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-27819-1_9","volume-title":"Learning Theory","author":"F. Denis","year":"2004","unstructured":"Denis, F., Esposito, Y.: Learning classes of probabilistic automata. In: Shawe-Taylor, J., Singer, Y. (eds.) COLT 2004. LNCS (LNAI), vol.\u00a03120, pp. 124\u2013139. Springer, Heidelberg (2004)"},{"issue":"3","key":"40_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. Found. Comput. Sci.\u00a019(3), 549\u2013563 (2008)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"Feng, L., Han, T., Kwiatkowska, M., Parker, D.: Learning-based compositional verification for synchronous probabilistic systems. Tech. Rep. RR-11-05, Department of Computer Science, University of Oxford (2011)","DOI":"10.1007\/978-3-642-24372-1_40"},{"key":"40_CR9","first-page":"133","volume-title":"Proc. QEST 2010","author":"L. Feng","year":"2010","unstructured":"Feng, L., Kwiatkowska, M., Parker, D.: Compositional verification of probabilistic systems using learning. In: Proc. QEST 2010, pp. 133\u2013142. IEEE CS Press, Los Alamitos (2010)"},{"key":"40_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-642-19835-9_11","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"V. Forejt","year":"2011","unstructured":"Forejt, V., Kwiatkowska, M., Norman, G., Parker, D., Qu, H.: Quantitative multi-objective verification for probabilistic systems. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol.\u00a06605, pp. 112\u2013127. Springer, Heidelberg (2011)"},{"issue":"2","key":"40_CR11","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1109\/TSE.2009.5","volume":"35","author":"T. Han","year":"2009","unstructured":"Han, T., Katoen, J.P., Damman, B.: Counterexample generation in probabilistic model checking. IEEE Trans. Software Eng.\u00a035(2), 241\u2013257 (2009)","journal-title":"IEEE Trans. Software Eng."},{"key":"40_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-540-30195-0_16","volume-title":"Grammatical Inference: Algorithms and Applications","author":"C. Higuera de la","year":"2004","unstructured":"de la Higuera, C., Oncina, J.: Learning stochastic finite automata. In: Paliouras, G., Sakakibara, Y. (eds.) ICGI 2004. LNCS (LNAI), vol.\u00a03264, pp. 175\u2013186. Springer, Heidelberg (2004)"},{"key":"40_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-12002-2_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M. Kwiatkowska","year":"2010","unstructured":"Kwiatkowska, M., Norman, G., Parker, D., Qu, H.: Assume-guarantee verification for probabilistic systems. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 23\u201337. Springer, Heidelberg (2010)"},{"issue":"3","key":"40_CR14","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10703-008-0049-6","volume":"32","author":"C. Pasareanu","year":"2008","unstructured":"Pasareanu, C., Giannakopoulou, D., Bobaru, M., Cobleigh, J., Barringer, H.: Learning to divide and conquer: Applying the L* algorithm to automate assume-guarantee reasoning. Formal Methods in System Design\u00a032(3), 175\u2013205 (2008)","journal-title":"Formal Methods in System Design"},{"key":"40_CR15","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","volume":"6","author":"M. Rabin","year":"1963","unstructured":"Rabin, M.: Probabilistic automata. Information and Control\u00a06, 230\u2013245 (1963)","journal-title":"Information and Control"},{"key":"40_CR16","unstructured":"Segala, R.: Modelling and Verification of Randomized Distributed Real Time Systems. Ph.D. thesis, Massachusetts Institute of Technology (1995)"},{"key":"40_CR17","first-page":"151","volume":"8","author":"W.G. Tzeng","year":"1992","unstructured":"Tzeng, W.G.: Learning probabilistic automata and Markov chains via queries. Mach. Learn.\u00a08, 151\u2013166 (1992)","journal-title":"Mach. Learn."},{"issue":"2","key":"40_CR18","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1137\/0221017","volume":"21","author":"W.G. Tzeng","year":"1992","unstructured":"Tzeng, W.G.: A polynomial-time algorithm for the equivalence of probabilistic automata. SIAM J. Comput.\u00a021(2), 216\u2013227 (1992)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24372-1_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T14:28:14Z","timestamp":1560695294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24372-1_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642243714","9783642243721"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24372-1_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}