{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T18:19:28Z","timestamp":1784830768958,"version":"3.55.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319111636","type":"print"},{"value":"9783319111643","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11164-3_26","type":"book-chapter","created":{"date-parts":[[2014,9,12]],"date-time":"2014-09-12T03:49:11Z","timestamp":1410493751000},"page":"307-322","source":"Crossref","is-referenced-by-count":154,"title":["The TTT Algorithm: A Redundancy-Free Approach to Active Automata Learning"],"prefix":"10.1007","author":[{"given":"Malte","family":"Isberner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Falk","family":"Howar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernhard","family":"Steffen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-642-32759-9_4","volume-title":"FM 2012: Formal Methods","author":"F. Aarts","year":"2012","unstructured":"Aarts, F., Heidarian, F., Kuppens, H., Olsen, P., Vaandrager, F.: Automata Learning through Counterexample Guided Abstraction Refinement. In: Giannakopoulou, D., M\u00e9ry, D. (eds.) FM 2012. LNCS, vol.\u00a07436, pp. 10\u201327. Springer, Heidelberg (2012), \n                    \n                      http:\/\/dx.doi.org\/10.1007\/978-3-642-32759-9_4"},{"issue":"2","key":"26_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. Inf. Comput.\u00a075(2), 87\u2013106 (1987)","journal-title":"Inf. Comput."},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Balc\u00e1zar, J.L., D\u00edaz, J., Gavald\u00e0, R.: Algorithms for Learning Finite Automata from Queries: A Unified View. In: Advances in Algorithms, Languages, and Complexity, pp. 53\u201372 (1997)","DOI":"10.1007\/978-1-4613-3394-4_2"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2004.12.015","volume":"118","author":"T. Berg","year":"2005","unstructured":"Berg, T., Jonsson, B., Leucker, M., Saksena, M.: Insights to Angluin\u2019s Learning. Electron. Notes Theor. Comput. Sci.\u00a0118, 3\u201318 (2005), \n                    \n                      http:\/\/dx.doi.org\/10.1016\/j.entcs.2004.12.015","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"26_CR5","unstructured":"Bertolino, A., Calabr\u00f2, A., Merten, M., Steffen, B.: Never-Stop Learning: Continuous Validation of Learned Models for Evolving Systems through Monitoring. ERCIM News\u00a02012(88) (2012)"},{"key":"26_CR6","unstructured":"Bollig, B., Habermehl, P., Kern, C., Leucker, M.: Angluin-style Learning of NFA. In: Proc. IJCAI 2009, San Francisco, CA, USA, pp. 1004\u20131009 (2009)"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Model-Based Testing of Reactive Systems","year":"2005","unstructured":"Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.): Model-Based Testing of Reactive Systems. LNCS, vol.\u00a03472. Springer, Heidelberg (2005)"},{"key":"26_CR8","first-page":"426","volume-title":"CCS 2010","author":"C.Y. Cho","year":"2010","unstructured":"Cho, C.Y., Babi\u0107, D., Shin, R., Song, D.: Inference and Analysis of Formal Models of Botnet Command and Control Protocols. In: CCS 2010, pp. 426\u2013440. ACM, Chicago (2010)"},{"key":"26_CR9","first-page":"623","volume-title":"Proc. OOPSLA 2013","author":"W. Choi","year":"2013","unstructured":"Choi, W., Necula, G., Sen, K.: Guided GUI Testing of Android Apps with Minimal Restart and Approximate Learning. In: Proc. OOPSLA 2013, pp. 623\u2013640. ACM, New York (2013), \n                    \n                      http:\/\/doi.acm.org\/10.1145\/2509136.2509552"},{"key":"26_CR10","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press (1999)"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Corbett, J., Dwyer, M., Hatcliff, J., Laubach, S., Pasareanu, C., Robby, Z.H.: Bandera: Extracting Finite-state Models from Java Source Code. In: Proc. Software Engineering, pp. 439\u2013448 (2000)","DOI":"10.1145\/337180.337234"},{"key":"26_CR12","first-page":"295","volume-title":"Western Joint Computer Conference, IRE-AIEE-ACM 1959","author":"R. Briandais De La","year":"1959","unstructured":"De La Briandais, R.: File Searching Using Variable Length Keys. In: Western Joint Computer Conference, IRE-AIEE-ACM 1959, Western, pp. 295\u2013298. ACM, New York (1959), \n                    \n                      http:\/\/doi.acm.org\/10.1145\/1457838.1457895"},{"issue":"4","key":"26_CR13","first-page":"469","volume":"7","author":"M. Domaratzki","year":"2002","unstructured":"Domaratzki, M., Kisman, D., Shallit, J.: On the Number of Distinct Languages Accepted by Finite Automata with n States. Journal of Automata, Languages and Combinatorics\u00a07(4), 469\u2013486 (2002)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-45923-5_6","volume-title":"Fundamental Approaches to Software Engineering","author":"A. Hagerer","year":"2002","unstructured":"Hagerer, A., Hungar, H.: Model generation by moderated regular extrapolation. In: Kutsche, R.-D., Weber, H. (eds.) FASE 2002. LNCS, vol.\u00a02306, pp. 80\u201395. Springer, Heidelberg (2002)"},{"key":"26_CR15","unstructured":"Howar, F.: Active Learning of Interface Programs. Ph.D. thesis, TU Dortmund University (2012), \n                    \n                      http:\/\/dx.doi.org\/2003\/29486"},{"key":"26_CR16","series-title":"CCIS","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-642-34781-8_18","volume-title":"Leveraging Applications of Formal Methods, Verification, and Validation","author":"F. Howar","year":"2012","unstructured":"Howar, F., Bauer, O., Merten, M., Steffen, B., Margaria, T.: The Teachers Crowd: The Impact of Distributed Oracles on Active Automata Learning. In: H\u00e4hnle, R., Knoop, J., Margaria, T., Schreiner, D., Steffen, B. (eds.) ISoLA 2011 Workshops 2011. CCIS, vol.\u00a0336, pp. 232\u2013247. Springer, Heidelberg (2012)"},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-642-27940-9_17","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"F. Howar","year":"2012","unstructured":"Howar, F., Steffen, B., Jonsson, B., Cassel, S.: Inferring Canonical Register Automata. In: Kuncak, V., Rybalchenko, A. (eds.) VMCAI 2012. LNCS, vol.\u00a07148, pp. 251\u2013266. Springer, Heidelberg (2012)"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Irfan, M.N., Oriat, C., Groz, R.: Angluin Style Finite State Machine Inference with Non-optimal Counterexamples. In: 1st Int. Workshop on Model Inference in Testing (2010)","DOI":"10.1145\/1868044.1868046"},{"issue":"1-2","key":"26_CR19","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10994-013-5419-7","volume":"96","author":"M. Isberner","year":"2014","unstructured":"Isberner, M., Howar, F., Steffen, B.: Learning Register Automata: From Languages to Program Structures. Machine Learning\u00a096(1-2), 65\u201398 (2014), \n                    \n                      http:\/\/dx.doi.org\/10.1007\/s10994-013-5419-7","journal-title":"Machine Learning"},{"key":"26_CR20","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)"},{"key":"26_CR21","first-page":"25","volume-title":"Proc. WODA 2006","author":"D. Lorenzoli","year":"2006","unstructured":"Lorenzoli, D., Mariani, L., Pezz\u00e8, M.: Inferring State-based Behavior Models. In: Proc. WODA 2006, pp. 25\u201332. ACM, New York (2006)"},{"issue":"2","key":"26_CR22","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"},{"issue":"2","key":"26_CR23","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s11334-005-0016-y","volume":"1","author":"T. Margaria","year":"2005","unstructured":"Margaria, T., Raffelt, H., Steffen, B.: Knowledge-based Relevance Filtering for Efficient System-level Test-based Model Generation. Innovations in Systems and Software Engineering\u00a01(2), 147\u2013156 (2005)","journal-title":"Innovations in Systems and Software Engineering"},{"issue":"4","key":"26_CR24","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":"26_CR25","doi-asserted-by":"crossref","unstructured":"Peled, D., Vardi, M.Y., Yannakakis, M.: Black Box Checking. In: Wu, J., Chanson, S.T., Gao, Q. (eds.) Proc. FORTE 1999, pp. 225\u2013240. Kluwer Academic (1999)","DOI":"10.1007\/978-0-387-35578-8_13"},{"issue":"2","key":"26_CR26","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 Futomata Using Homing Sequences. Inf. Comput.\u00a0103(2), 299\u2013347 (1993)","journal-title":"Inf. Comput."},{"key":"26_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-05089-3_14","volume-title":"FM 2009: Formal Methods","author":"M. Shahbaz","year":"2009","unstructured":"Shahbaz, M., Groz, R.: Inferring Mealy Machines. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol.\u00a05850, pp. 207\u2013222. Springer, Heidelberg (2009)"},{"key":"26_CR28","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)"}],"container-title":["Lecture Notes in Computer Science","Runtime Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11164-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T17:50:02Z","timestamp":1558979402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11164-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319111636","9783319111643"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11164-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}