{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:49:44Z","timestamp":1757540984867},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642347801"},{"type":"electronic","value":"9783642347818"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-34781-8_19","type":"book-chapter","created":{"date-parts":[[2012,10,11]],"date-time":"2012-10-11T15:20:37Z","timestamp":1349968837000},"page":"248-260","source":"Crossref","is-referenced-by-count":14,"title":["Automata Learning with On-the-Fly Direct Hypothesis Construction"],"prefix":"10.1007","author":[{"given":"Maik","family":"Merten","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Falk","family":"Howar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernhard","family":"Steffen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tiziana","family":"Margaria","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-642-16573-3_14","volume-title":"Testing Software and Systems","author":"F. Aarts","year":"2010","unstructured":"Aarts, F., Jonsson, B., Uijen, J.: Generating Models of Infinite-State Communication Protocols Using Regular Inference with Abstraction. In: Petrenko, A., Sim\u00e3o, A., Maldonado, J.C. (eds.) ICTSS 2010. LNCS, vol.\u00a06435, pp. 188\u2013204. Springer, Heidelberg (2010)"},{"issue":"2","key":"19_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"},{"issue":"1","key":"19_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik\u00a01(1), 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"19_CR4","series-title":"CCIS","first-page":"232","volume-title":"ISoLA 2011 Workshops","author":"F. Howar","year":"2012","unstructured":"Howar, F., Bauer, O., Merten, M., Steffen, B., Margaria, T.: The Teachers\u2019 Crowd: The Impact of Distributed Oracles on Active Automata Learning. In: H\u00e4hnle, R., et al. (eds.) ISoLA 2011 Workshops. CCIS, vol.\u00a0336, pp. 232\u2013247. Springer, Heidelberg (2012)"},{"issue":"1","key":"19_CR5","first-page":"37","volume":"21","author":"S. Jabbar","year":"2007","unstructured":"Jabbar, S.: External directed search. KI\u00a021(1), 37\u201338 (2007)","journal-title":"KI"},{"key":"19_CR6","unstructured":"Jabbar, S.: External memory algorithms for state space exploration in model checking and action planning. PhD thesis (2008)"},{"key":"19_CR7","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3897.001.0001","volume-title":"An Introduction to Computational Learning Theory","author":"M.J. Kearns","year":"1994","unstructured":"Kearns, M.J., Vazirani, U.V.: An Introduction to Computational Learning Theory. MIT Press, Cambridge (1994)"},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1006\/inco.1995.1070","volume":"118","author":"O. Maler","year":"1995","unstructured":"Maler, O., Pnueli, A.: On the Learnability of Infinitary Regular Sets. Information and Computation\u00a0118(2), 316\u2013326 (1995)","journal-title":"Information and Computation"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-642-28756-5_32","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M. Merten","year":"2012","unstructured":"Merten, M., Howar, F., Steffen, B., Cassel, S., Jonsson, B.: Demonstrating Learning of Register Automata. In: Flanagan, C., K\u00f6nig, B. (eds.) TACAS 2012. LNCS, vol.\u00a07214, pp. 466\u2013471. Springer, Heidelberg (2012)"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-642-19835-9_18","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M. Merten","year":"2011","unstructured":"Merten, M., Steffen, B., Howar, F., Margaria, T.: Next Generation LearnLib. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol.\u00a06605, pp. 220\u2013223. Springer, Heidelberg (2011)"},{"issue":"4","key":"19_CR11","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1090\/S0002-9939-1958-0135681-9","volume":"9","author":"A. Nerode","year":"1958","unstructured":"Nerode, A.: Linear Automaton Transformations. Proceedings of the American Mathematical Society\u00a09(4), 541\u2013544 (1958)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"19_CR12","unstructured":"Niese, O.: An Integrated Approach to Testing Complex Systems. PhD thesis, University of Dortmund, Germany (2003)"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1390832.1390833","volume-title":"TAV-WEB 2008: Proceedings of the 2008 Workshop on Testing, Analysis, and Verification of Web Services and Applications","author":"H. Raffelt","year":"2008","unstructured":"Raffelt, H., Margaria, T., Steffen, B., Merten, M.: Hybrid test of web applications with webtest. In: TAV-WEB 2008: Proceedings of the 2008 Workshop on Testing, Analysis, and Verification of Web Services and Applications, pp. 1\u20137. ACM, New York (2008)"},{"issue":"4","key":"19_CR14","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10009-009-0120-7","volume":"11","author":"H. Raffelt","year":"2009","unstructured":"Raffelt, H., Merten, M., Steffen, B., Margaria, T.: Dynamic testing via automata learning. Int. J. Softw. Tools Technol. Transf.\u00a011(4), 307\u2013324 (2009)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"issue":"5","key":"19_CR15","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s10009-009-0111-8","volume":"11","author":"H. Raffelt","year":"2009","unstructured":"Raffelt, H., Steffen, B., Berg, T., Margaria, T.: LearnLib: a framework for extrapolating behavioral models. Int. J. Softw. Tools Technol. Transf.\u00a011(5), 393\u2013407 (2009)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"issue":"2","key":"19_CR16","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1006\/inco.1993.1021","volume":"103","author":"R.L. Rivest","year":"1993","unstructured":"Rivest, R.L., Schapire, R.E.: Inference of finite automata using homing sequences. Inf. Comput.\u00a0103(2), 299\u2013347 (1993)","journal-title":"Inf. Comput."},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-642-21455-4_8","volume-title":"Formal Methods for Eternal Networked Software Systems","author":"B. Steffen","year":"2011","unstructured":"Steffen, B., Howar, F., Merten, M.: Introduction to Active Automata Learning from a Practical Perspective. In: Bernardo, M., Issarny, V. (eds.) SFM 2011. LNCS, vol.\u00a06659, pp. 256\u2013296. Springer, Heidelberg (2011)"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Sulewski, D., Edelkamp, S., Kissmann, P.: Exploiting the computational power of the graphics card: Optimal state space planning on the gpu. In: Bacchus, F., Domshlak, C., Edelkamp, S., Helmert, M. (eds.) ICAPS. AAAI (2011)","DOI":"10.1609\/icaps.v21i1.13464"}],"container-title":["Communications in Computer and Information Science","Leveraging Applications of Formal Methods, Verification, and Validation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34781-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T05:34:01Z","timestamp":1687757641000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34781-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642347801","9783642347818"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34781-8_19","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2012]]}}}