{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:29:30Z","timestamp":1759336170389},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540373766"},{"type":"electronic","value":"9783540373773"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11817949_29","type":"book-chapter","created":{"date-parts":[[2006,8,2]],"date-time":"2006-08-02T19:59:29Z","timestamp":1154548769000},"page":"435-449","source":"Crossref","is-referenced-by-count":33,"title":["Inference of Event-Recording Automata Using Timed Decision Trees"],"prefix":"10.1007","author":[{"given":"Olga","family":"Grinchtein","sequence":"first","affiliation":[]},{"given":"Bengt","family":"Jonsson","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Pettersson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.: A theory of timed automata. Theoretical Computer Science\u00a0126, 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0304-3975(97)00173-4","volume":"211","author":"R. Alur","year":"1999","unstructured":"Alur, R., Fix, L., Henzinger, T.: Event-clock automata: A determinizable class of timed automata. Theoretical Computer Science\u00a0211, 253\u2013273 (1999)","journal-title":"Theoretical Computer Science"},{"key":"29_CR3","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, 87\u2013106 (1987)","journal-title":"Information and Computation"},{"key":"29_CR4","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)"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BFb0020949","volume-title":"Hybrid Systems III","author":"J. Bengtsson","year":"1996","unstructured":"Bengtsson, J., Larsen, K.G., Larsson, F., Pettersson, P., Yi, W.: UPPAAL: a tool suite for the automatic verification of real-time systems. In: Alur, R., Sontag, E.D., Henzinger, T.A. (eds.) HS 1995. LNCS, vol.\u00a01066, pp. 232\u2013243. Springer, Heidelberg (1996)"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/BFb0028779","volume-title":"Computer Aided Verification","author":"M. Bozga","year":"1998","unstructured":"Bozga, M., Daws, C., Maler, O., Olivero, A., Tripakis, S., Yovine, S.: Kronos: A model-checking tool for real-time systems. In: Hu, A.J., Vardi, M.Y. (eds.) CAV 1998. LNCS, vol.\u00a01427, pp. 546\u2013550. Springer, Heidelberg (1998)"},{"key":"29_CR7","volume-title":"Model Checking","author":"E. Clarke","year":"1999","unstructured":"Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Corbett, J., Dwyer, M., Hatcliff, J., Laubach, S., Pasareanu, C., Roby, Zheng, H.: Bandera: Extracting finite-state models from java source code. In: Proc. 22nd Int. Conf. on Software Engineering (June 2000)","DOI":"10.1145\/337180.337234"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Fernandez, J.-C., Jard, C., J\u00e9ron, T., Viho, C.: An experiment in automatic generation of test suites for protocols with verification technology. Science of Computer Programming\u00a029 (1997)","DOI":"10.1016\/S0167-6423(96)00032-9"},{"key":"29_CR10","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, 447\u2013474 (1967)","journal-title":"Information and Control"},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-540-30206-3_26","volume-title":"Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems","author":"O. Grinchtein","year":"2004","unstructured":"Grinchtein, O., Jonsson, B., Leucker, M.: Learning of Event-Recording Automata. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS 2004 and FTRTFT 2004. LNCS, vol.\u00a03253, pp. 379\u2013395. Springer, Heidelberg (2004)"},{"issue":"3","key":"29_CR12","first-page":"87","volume":"138","author":"O. Grinchtein","year":"2005","unstructured":"Grinchtein, O., Jonsson, B., Leucker, M.: Inference of timed transition systems. ENCS\u00a0138(3), 87\u201399 (2005)","journal-title":"ENCS"},{"key":"29_CR13","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, p. 357. Springer, Heidelberg (2002)"},{"key":"29_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., 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)"},{"issue":"4","key":"29_CR15","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1109\/32.54292","volume":"16","author":"D. Harel","year":"1990","unstructured":"Harel, D., Lachover, H., Naamad, A., Pnueli, A., Politi, M., Sherman, R., Shtull-Trauring, A., Trakhtenbrot, M.: STATEMATE: A working environment for the development of complex reactive systems. IEEE Trans. on Software Engineering\u00a016(4), 403\u2013414 (1990)","journal-title":"IEEE Trans. on Software Engineering"},{"key":"29_CR16","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1006\/inco.1994.1060","volume":"112","author":"T. Henzinger","year":"1994","unstructured":"Henzinger, T., Manna, Z., Pnueli, A.: Temporal proof methodologies for timed transition systems. Information and Computation\u00a0112, 173\u2013337 (1994)","journal-title":"Information and Computation"},{"key":"29_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/BFb0055086","volume-title":"Automata, Languages and Programming","author":"T. Henzinger","year":"1998","unstructured":"Henzinger, T., Raskin, J.-F., Schobbens, P.-Y.: The Regular Real-Time Languages. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 580\u2013591. Springer, Heidelberg (1998)"},{"key":"29_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/10722468_8","volume-title":"SPIN Model Checking and Software Verification","author":"G. Holzmann","year":"2000","unstructured":"Holzmann, G.: Logic verification of ANSI-C code with SPIN. In: Havelund, K., Penix, J., Visser, W. (eds.) SPIN 2000. LNCS, vol.\u00a01885, pp. 131\u2013147. Springer, Heidelberg (2000)"},{"key":"29_CR19","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)"},{"key":"29_CR20","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3897.001.0001","volume-title":"An Introduction to Computational Learning Theory","author":"M. Kearns","year":"1994","unstructured":"Kearns, M., Vazirani, U.: An Introduction to Computational Learning Theory. MIT Press, Cambridge (1994)"},{"key":"29_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-540-24727-2_25","volume-title":"Foundations of Software Science and Computation Structures","author":"O. Maler","year":"2004","unstructured":"Maler, O., Pnueli, A.: On recognizable timed languages. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 348\u2013362. Springer, Heidelberg (2004)"},{"key":"29_CR22","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1006\/inco.1993.1021","volume":"103","author":"R. Rivest","year":"1993","unstructured":"Rivest, R., Schapire, R.: Inference of finite automata using homing sequences. Information and Computation\u00a0103, 299\u2013347 (1993)","journal-title":"Information and Computation"},{"key":"29_CR23","unstructured":"Schmitt, M., Ebner, M., Grabowski, J.: Test generation with autolink and testcomposer. In: Proc. 2nd Workshop of the SDL Forum Society on SDL and MSC - SAM 2000 (June 2000)"},{"key":"29_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/3-540-61648-9_38","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"J. Springintveld","year":"1996","unstructured":"Springintveld, J., Vaandrager, F.: Minimizable timed automata. In: Jonsson, B., Parrow, J. (eds.) FTRTFT 1996. LNCS, vol.\u00a01135, pp. 130\u2013147. Springer, Heidelberg (1996)"},{"key":"29_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1007\/3-540-58468-4_191","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"T. Wilke","year":"1994","unstructured":"Wilke, T.: Specifying timed state sequences in powerful decidable logics and timed automata. In: Langmaack, H., de Roever, W.-P., Vytopil, J. (eds.) FTRTFT 1994 and ProCoS 1994. LNCS, vol.\u00a0863, pp. 694\u2013715. Springer, Heidelberg (1994)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2006 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11817949_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:15:50Z","timestamp":1605644150000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11817949_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540373766","9783540373773"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11817949_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}