{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T07:47:59Z","timestamp":1771573679841,"version":"3.50.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319336923","type":"print"},{"value":"9783319336930","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-33693-0_19","type":"book-chapter","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T05:35:47Z","timestamp":1464068147000},"page":"295-310","source":"Crossref","is-referenced-by-count":6,"title":["Enhancing Automata Learning by Log-Based Metrics"],"prefix":"10.1007","author":[{"given":"Petra","family":"van den Bos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rick","family":"Smetsers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits","family":"Vaandrager","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,24]]},"reference":[{"issue":"2","key":"19_CR1","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1109\/TSE.2008.106","volume":"35","author":"L Alfaro De","year":"2009","unstructured":"De Alfaro, L., Faella, M., Stoelinga, M.: Linear and branching system metrics. IEEE Trans. Software Eng. 35(2), 258\u2013273 (2009)","journal-title":"IEEE Trans. Software Eng."},{"issue":"2","key":"19_CR2","doi-asserted-by":"crossref","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. 75(2), 87\u2013106 (1987)","journal-title":"Inf. Comput."},{"issue":"12","key":"19_CR3","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/S0019-9958(82)91250-5","volume":"54","author":"JW Bakker De","year":"1982","unstructured":"De Bakker, J.W., Zucker, J.I.: Processes and the denotational semantics of concurrency. Inf. Control 54(12), 70\u2013120 (1982)","journal-title":"Inf. Control"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Van den Bos, P.: Enhancing active automata learning by a user log based metric. Master\u2019s thesis, Radboud University Nijmegen (2015)","DOI":"10.1007\/978-3-319-33693-0_19"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/11901914_30","volume-title":"Automated Technology for Verification and Analysis","author":"LB Briones","year":"2006","unstructured":"Briones, L.B., Brinksma, E., Stoelinga, M.: A semantic framework for test coverage. In: Graf, S., Zhang, W. (eds.) ATVA 2006. LNCS, vol. 4218, pp. 399\u2013414. Springer, Heidelberg (2006)"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/978-3-642-15375-4_18","volume-title":"CONCUR 2010 - Concurrency Theory","author":"P \u010cern\u00fd","year":"2010","unstructured":"\u010cern\u00fd, P., Henzinger, T.A., Radhakrishna, A.: Simulation distances. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 253\u2013268. Springer, Heidelberg (2010)"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1022","DOI":"10.1007\/3-540-45061-0_79","volume-title":"Automata, Languages and Programming","author":"L Alfaro de","year":"2003","unstructured":"de Alfaro, L., Henzinger, T.A., Majumdar, R.: Discounting the future in systems theory. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 1022\u20131037. Springer, Heidelberg (2003)"},{"key":"19_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139194655","volume-title":"Grammatical Inference","author":"C Higuera de la","year":"2010","unstructured":"de la Higuera, C.: Grammatical Inference. Cambridge University Press, Cambridge (2010)"},{"key":"19_CR9","unstructured":"de Ruiter, J., Poll, E.: Protocol state fuzzing of TLS implementations. In: USENIX Security 2015, pp. 193\u2013206. USENIX Association, Washington, D.C., August 2015"},{"issue":"10","key":"19_CR10","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1145\/355604.361591","volume":"15","author":"EW Dijkstra","year":"1972","unstructured":"Dijkstra, E.W.: The humble programmer. CACM 15(10), 859\u2013866 (1972)","journal-title":"CACM"},{"key":"19_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-01492-5","volume-title":"Handbook of Weighted Automata","author":"M Droste","year":"2009","unstructured":"Droste, M., Kuich, W., Vogler, H.: Handbook of Weighted Automata, 1st edn. Springer, Heidelberg (2009)","edition":"1"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/978-3-319-10702-8_6","volume-title":"Formal Methods for Industrial Critical Systems","author":"P Fiter\u0103u-Bro\u015ftean","year":"2014","unstructured":"Fiter\u0103u-Bro\u015ftean, P., Janssen, R., Vaandrager, F.: Learning fragments of the TCP network protocol. In: Lang, F., Flammini, F. (eds.) FMICS 2014. LNCS, vol. 8718, pp. 78\u201393. Springer, Heidelberg (2014)"},{"key":"19_CR13","unstructured":"Fiter\u0103u-Bro\u015ftean, P., Janssen, R., Vaandrager, F.: Combining model learning and model checking to analyze TCP implementations. Submitted to CAV (2016). http:\/\/www.sws.cs.ru.nl\/publications\/papers\/fvaan\/FJV16\/"},{"issue":"4","key":"19_CR14","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s00450-013-0251-7","volume":"28","author":"T Henzinger","year":"2013","unstructured":"Henzinger, T.: Quantitative reactive modeling and verification. Comput. Sci. Res. Dev. 28(4), 331\u2013344 (2013)","journal-title":"Comput. Sci. Res. Dev."},{"key":"19_CR15","unstructured":"Isberner, M.: Foundations of Active Automata Learning: An Algorithmic Perspective. Ph.D. thesis, Technical University of Dortmund (2015)"},{"issue":"8","key":"19_CR16","doi-asserted-by":"crossref","first-page":"1090","DOI":"10.1109\/5.533956","volume":"84","author":"D Lee","year":"1996","unstructured":"Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines-a survey. Proc. IEEE 84(8), 1090\u20131123 (1996)","journal-title":"Proc. IEEE"},{"issue":"5","key":"19_CR17","doi-asserted-by":"crossref","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. STTT 11(5), 393\u2013407 (2009)","journal-title":"STTT"},{"issue":"2","key":"19_CR18","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1006\/inco.1993.1021","volume":"103","author":"RL Rivest","year":"1993","unstructured":"Rivest, R.L., Schapire, R.E.: Inference of finite automata using homing sequences. Inf. Comput. 103(2), 299\u2013347 (1993)","journal-title":"Inf. Comput."},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Schuts, M., Hooman, J., Vaandrager, F.: Refactoring of legacy software using model learning and equivalence checking: an industrial experience report. In: Proceedings of iFM (2016)","DOI":"10.1007\/978-3-319-33693-0_20"},{"key":"19_CR20","unstructured":"Smeenk, W.: Applying automata learning to complex industrial software. Master\u2019s thesis, Radboud University Nijmegen, September 2012"},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/978-3-319-25423-4_5","volume-title":"Formal Methods and Software Engineering","author":"W Smeenk","year":"2015","unstructured":"Smeenk, W., Moerman, J., Vaandrage, F., Jansen, D.N.: Applying Automata Learning to Embedded Control Software. In: Butler, M., Conchon, S., Za\u00efdi, F. (eds.) ICFEM 2015. LNCS, vol. 9407, pp. 67\u201383. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-25423-4_5"},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/978-3-319-30000-9_14","volume-title":"Language and Automata Theory and Applications","author":"R Smetsers","year":"2016","unstructured":"Smetsers, R., Moerman, J., Jansen, D.N.: Minimal separating sequences for all Pairs of states. In: Dediu, A.-H., Janou\u0161ek, J., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2016. LNCS, vol. 9618, pp. 181\u2013193. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-30000-9_14"},{"key":"19_CR23","unstructured":"Smetsers, R., Volpato, M., Vaandrager, F., Verwer, S.: Bigger is not always better: on the quality of hypotheses in active automata learning. In: Proceedings of ICGI, JMLR: W&CP, vol. 34, pp. 167\u2013181 (2014)"},{"key":"19_CR24","volume-title":"Software Engineering","author":"I Sommerville","year":"2001","unstructured":"Sommerville, I.: Software Engineering. Addison-Wesley Publishing Company, Boston (2001)"},{"key":"19_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 6659, pp. 256\u2013296. Springer, Heidelberg (2011)"},{"issue":"7","key":"19_CR26","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1016\/j.jlap.2010.07.010","volume":"79","author":"C Thrane","year":"2010","unstructured":"Thrane, C., Fahrenberg, U., Larsen, K.G.: Quantitative analysis of weighted transition systems. J. Logic Algebraic Program. 79(7), 689\u2013703 (2010)","journal-title":"J. Logic Algebraic Program."}],"container-title":["Lecture Notes in Computer Science","Integrated Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-33693-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T01:00:36Z","timestamp":1600650036000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-33693-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319336923","9783319336930"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-33693-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}