{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T06:34:47Z","timestamp":1794378887183,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540254201","type":"print"},{"value":"9783540319849","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31984-9_14","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T10:26:18Z","timestamp":1279016778000},"page":"175-189","source":"Crossref","is-referenced-by-count":75,"title":["On the Correspondence Between Conformance Testing and Regular Inference"],"prefix":"10.1007","author":[{"given":"Therese","family":"Berg","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Olga","family":"Grinchtein","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bengt","family":"Jonsson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Leucker","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Harald","family":"Raffelt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernhard","family":"Steffen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/S0019-9958(81)90090-5","volume":"51","author":"D. Angluin","year":"1981","unstructured":"Angluin, D.: A note on the number of queries needed to identify regular languages. Information and Control\u00a051(1), 76\u201387 (1981)","journal-title":"Information and Control"},{"issue":"2","key":"14_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":"14_CR3","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/978-1-4613-3394-4_2","volume-title":"Advances in Algorithms, Languages, and Complexity","author":"J.L. Balc\u00e1zar","year":"1997","unstructured":"Balc\u00e1zar, J.L., D\u00edaz, J., Gavald\u00e1, R.: Algorithms for learning finite automata from queries: A unified view. In: Advances in Algorithms, Languages, and Complexity, pp. 53\u201372. Kluwer, Dordrecht (1997)"},{"issue":"3","key":"14_CR4","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1109\/TSE.1978.231496","volume":"4","author":"T.S. Chow","year":"1978","unstructured":"Chow, T.S.: Testing software design modeled by finite-state machines. IEEE Trans. on Software Engineering\u00a04(3), 178\u2013187 (1978); Special collection based on COMPSAC","journal-title":"IEEE Trans. on Software Engineering"},{"issue":"6","key":"14_CR5","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1109\/32.87284","volume":"17","author":"S. Fujiwara","year":"1991","unstructured":"Fujiwara, S., Bochmann, G.v., Khendek, F., Amalou, M., Ghedamsi, A.: Test selection based on finite state models. IEEE Trans. on Software Engineering\u00a017(6), 591\u2013603 (1991)","journal-title":"IEEE Trans. on Software Engineering"},{"issue":"5","key":"14_CR6","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit. Information and Control\u00a010(5), 447\u2013474 (1967)","journal-title":"Information and Control"},{"issue":"3","key":"14_CR7","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"E.M. Gold","year":"1978","unstructured":"Gold, E.M.: Complexity of automaton identification from given data. Information and Control\u00a037(3), 302\u2013320 (1978)","journal-title":"Information and Control"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/3-540-46002-0_25","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Groce","year":"2002","unstructured":"Groce, A., Peled, D., Yannakakis, M.: Adaptive model checking. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol.\u00a02280, pp. 357\u2013370. Springer, Heidelberg (2002)"},{"key":"14_CR9","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., Niese, O., Steffen, B.: 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":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-540-45069-6_31","volume-title":"Computer Aided Verification","author":"H. Hungar","year":"2003","unstructured":"Hungar, H., Niese, O., Steffen, B.: Domain-specific optimization in automata learning. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 315\u2013327. Springer, Heidelberg (2003)"},{"issue":"8","key":"14_CR11","doi-asserted-by":"publisher","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 \u2013 a survey. Proc. IEEE\u00a084(8), 1090\u20131126 (1996)","journal-title":"Proc. IEEE"},{"key":"14_CR12","series-title":"Series in Machine Perception and Artificial Intelligence","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1142\/9789812797902_0004","volume-title":"Pattern Recognition and Image Analysis","author":"J. Oncina","year":"1992","unstructured":"Oncina, J., Garc\u00eda, P.: Inferring regular languages in polynomial update time. In: Pattern Recognition and Image Analysis. Series in Machine Perception and Artificial Intelligence, vol.\u00a01, pp. 49\u201361. World Scientific, Singapore (1992)"},{"key":"14_CR13","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/978-0-387-35578-8_13","volume-title":"Formal Methods for Protocol Engineering and Distributed Systems, FORTE\/PSTV","author":"D. Peled","year":"1999","unstructured":"Peled, D., Vardi, M.Y., Yannakakis, M.: Black box checking. In: Wu, J., Chanson, S.T., Gao, Q. (eds.) Formal Methods for Protocol Engineering and Distributed Systems, FORTE\/PSTV, Beijing, China, pp. 225\u2013240. Kluwer, Dordrecht (1999)"},{"key":"14_CR14","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. Information and Computation\u00a0103, 299\u2013347 (1993)","journal-title":"Information and Computation"},{"issue":"4","key":"14_CR15","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0169-7552(88)90064-5","volume":"15","author":"K. Sabnani","year":"1988","unstructured":"Sabnani, K., Dahbura, A.: A protocol test generation procedure. Computer Networks and ISDN Systems\u00a015(4), 285\u2013297 (1988)","journal-title":"Computer Networks and ISDN Systems"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/3-540-36384-X_3","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"B. Steffen","year":"2003","unstructured":"Steffen, B., Hungar, H.: Behavior-based model construction. In: Zuck, L.D., Attie, P.C., Cortesi, A., Mukhopadhyay, S. (eds.) VMCAI 2003. LNCS, vol.\u00a02575, pp. 5\u201319. Springer, Heidelberg (2003)"},{"issue":"4","key":"14_CR17","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/BF01068590","volume":"9","author":"M.P. Vasilevski","year":"1973","unstructured":"Vasilevski, M.P.: Failure diagnosis of automata. Cybernetic\u00a09(4), 653\u2013665 (1973)","journal-title":"Cybernetic"},{"key":"14_CR18","first-page":"161","volume-title":"Proc. 2nd Int. Workshop on Protocol Test Systems","author":"S.T. Vuong","year":"1990","unstructured":"Vuong, S.T., Chan, W.Y.L., Ito, M.R.: The UIOv-method for protocol test sequence generation. In: Proc. 2nd Int. Workshop on Protocol Test Systems, pp. 161\u2013176. North-Holland, Amsterdam (1990)"}],"container-title":["Lecture Notes in Computer Science","Fundamental Approaches to Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31984-9_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:44:46Z","timestamp":1619999086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31984-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540254201","9783540319849"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31984-9_14","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b107062","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}