{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T07:48:51Z","timestamp":1771573731940,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031331695","type":"print"},{"value":"9783031331701","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-33170-1_7","type":"book-chapter","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T12:55:27Z","timestamp":1685710527000},"page":"104-121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Learning Symbolic Timed Models from\u00a0Concrete Timed Data"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9730-9335","authenticated-orcid":false,"given":"Simon","family":"Dierl","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9524-4459","authenticated-orcid":false,"given":"Falk Maria","family":"Howar","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6341-3898","authenticated-orcid":false,"given":"Sean","family":"Kauffman","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0173-9486","authenticated-orcid":false,"given":"Martin","family":"Kristjansen","sequence":"additional","affiliation":[]},{"given":"Kim","family":"Guldstrand Larsen","sequence":"additional","affiliation":[]},{"given":"Florian","family":"Lorber","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3030-3873","authenticated-orcid":false,"given":"Malte","family":"Mauritz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,3]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","unstructured":"Aichernig, B.K., Mu\u0161kardin, E., Pferscher, A.: Active vs. passive: a comparison of automata learning paradigms for network protocols. Electron. Proc. Theor. Comput. Sci. 371, 1\u201319 (2022). https:\/\/doi.org\/10.4204\/eptcs.371.1, FMAS\/ASYDE 2022","DOI":"10.4204\/eptcs.371.1"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-55754-6_1","volume-title":"NASA Formal Methods","author":"BK Aichernig","year":"2020","unstructured":"Aichernig, B.K., Pferscher, A., Tappler, M.: From passive to active: learning timed automata efficiently. In: Lee, R., Jha, S., Mavridou, A., Giannakopoulou, D. (eds.) NFM 2020. LNCS, vol. 12229, pp. 1\u201319. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-55754-6_1"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/978-3-030-45190-5_25","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J An","year":"2020","unstructured":"An, J., Chen, M., Zhan, B., Zhan, N., Zhang, M.: Learning one-clock timed automata. In: TACAS 2020. LNCS, vol. 12078, pp. 444\u2013462. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45190-5_25"},{"issue":"2","key":"7_CR4","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. 75(2), 87\u2013106 (1987). https:\/\/doi.org\/10.1016\/0890-5401(87)90052-6","journal-title":"Inf. Comput."},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Biermann, A.W., Feldman, J.A.: On the synthesis of finite-state machines from samples of their behavior. IEEE Trans. Comput. C-21(6), 592\u2013597 (1972). https:\/\/doi.org\/10.1109\/TC.1972.5009015","DOI":"10.1109\/TC.1972.5009015"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Busany, N., Maoz, S., Yulazari, Y.: Size and accuracy in model inference. In: 2019 34th IEEE\/ACM International Conference on Automated Software Engineering (ASE), pp. 887\u2013898, November 2019. https:\/\/doi.org\/10.1109\/ASE.2019.00087, ASE 2019","DOI":"10.1109\/ASE.2019.00087"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Cohen, H., Maoz, S.: The confidence in our k-tails. In: Proceedings of the 29th ACM\/IEEE International Conference on Automated Software Engineering, pp. 605\u2013610. Association for Computing Machinery, New York, NY, USA, September 2014. https:\/\/doi.org\/10.1145\/2642937.2642944, ASE \u201914","DOI":"10.1145\/2642937.2642944"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Cornanguer, L., Largou\u00e4t, C., Roz\u00e9, L., Termier, A.: TAG: learning timed automata from logs. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 4, pp. 3949\u20133958 (2022). https:\/\/doi.org\/10.1609\/aaai.v36i4.20311","DOI":"10.1609\/aaai.v36i4.20311"},{"key":"7_CR9","doi-asserted-by":"publisher","unstructured":"Dierl, S., et al.: Learning symbolic timed models from concrete timed data - data and replication package (2023). https:\/\/doi.org\/10.5281\/zenodo.7766789","DOI":"10.5281\/zenodo.7766789"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-030-26601-1_7","volume-title":"Computer Safety, Reliability, and Security","author":"UT Gabor","year":"2019","unstructured":"Gabor, U.T., Dierl, S., Spinczyk, O.: Spectrum-based fault localization in deployed embedded systems with driver interaction models. In: Romanovsky, A., Troubitsyna, E., Bitsch, F. (eds.) SAFECOMP 2019. LNCS, vol. 11698, pp. 97\u2013112. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26601-1_7"},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Gansner, E.R., North, S.C.: An open graph visualization system and its applications to software engineering. Softw. Pract. Exp. 30(11), 1203\u20131233 (2000). https:\/\/doi.org\/10.1002\/1097-024X(200009)30:11<1203::AID-SPE338>3.0.CO;2-N","DOI":"10.1002\/1097-024X(200009)30:11<1203::AID-SPE338>3.0.CO;2-N"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/11817949_29","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"O Grinchtein","year":"2006","unstructured":"Grinchtein, O., Jonsson, B., Pettersson, P.: Inference of event-recording automata using timed decision trees. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 435\u2013449. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11817949_29"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-030-57628-8_9","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"L Henry","year":"2020","unstructured":"Henry, L., J\u00e9ron, T., Markey, N.: Active learning of timed automata with unobservable resets. In: Bertrand, N., Jansen, N. (eds.) FORMATS 2020. LNCS, vol. 12288, pp. 144\u2013160. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57628-8_9"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-319-96562-8_5","volume-title":"Machine Learning for Dynamic Software Analysis: Potentials and Limits","author":"F Howar","year":"2018","unstructured":"Howar, F., Steffen, B.: Active automata learning in practice. In: Bennaceur, A., H\u00e4hnle, R., Meinke, K. (eds.) Machine Learning for Dynamic Software Analysis: Potentials and Limits. LNCS, vol. 11026, pp. 123\u2013148. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96562-8_5"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-319-11164-3_26","volume-title":"Runtime Verification","author":"M Isberner","year":"2014","unstructured":"Isberner, M., Howar, F., Steffen, B.: The TTT algorithm: a redundancy-free approach to active automata learning. In: Bonakdarpour, B., Smolka, S.A. (eds.) RV 2014. LNCS, vol. 8734, pp. 307\u2013322. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11164-3_26"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-319-21690-4_32","volume-title":"Computer Aided Verification","author":"M Isberner","year":"2015","unstructured":"Isberner, M., Howar, F., Steffen, B.: The open-source LearnLib. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 487\u2013495. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21690-4_32"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Iversen, T.K., et al.: Model-checking real-time control programs: verifying lego mindstorms tm systems using uppaal. In: Proceedings 12th Euromicro Conference on Real-Time Systems. Euromicro RTS 2000, pp. 147\u2013155. IEEE (2000)","DOI":"10.1109\/EMRTS.2000.854002"},{"key":"7_CR18","doi-asserted-by":"publisher","unstructured":"Jeppu, N.Y., Melham, T., Kroening, D., O\u2019Leary, J.: Learning concise models from long execution traces. In: 2020 57th ACM\/IEEE Design Automation Conference (DAC), pp. 1\u20136 (2020). https:\/\/doi.org\/10.1109\/DAC18072.2020.9218613","DOI":"10.1109\/DAC18072.2020.9218613"},{"key":"7_CR19","doi-asserted-by":"publisher","unstructured":"Maier, A.: Online passive learning of timed automata for cyber-physical production systems. In: IEEE International Conference on Industrial Informatics (INDIN 2014), pp. 60\u201366. IEEE (2014). https:\/\/doi.org\/10.1109\/INDIN.2014.6945484","DOI":"10.1109\/INDIN.2014.6945484"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/978-3-642-34026-0_38","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change","author":"A de Matos Pedro","year":"2012","unstructured":"de Matos Pedro, A., Crocker, P.A., de Sousa, S.M.: Learning stochastic timed automata from sample executions. In: Margaria, T., Steffen, B. (eds.) ISoLA 2012. LNCS, vol. 7609, pp. 508\u2013523. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34026-0_38"},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Narayan, A., Cutulenco, G., Joshi, Y., Fischmeister, S.: Mining timed regular specifications from system traces. ACM Trans. Embed. Comput. Syst. 17(2), 46:1\u201346:21 (2018). https:\/\/doi.org\/10.1145\/3147660","DOI":"10.1145\/3147660"},{"issue":"2","key":"7_CR22","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1109\/TSE.2020.2998527","volume":"48","author":"F Pastore","year":"2022","unstructured":"Pastore, F., Micucci, D., Guzman, M., Mariani, L.: TkT: automatic inference of timed and extended pushdown automata. IEEE Trans. Softw. Eng. 48(2), 617\u2013636 (2022). https:\/\/doi.org\/10.1109\/TSE.2020.2998527","journal-title":"IEEE Trans. Softw. Eng."},{"key":"7_CR23","doi-asserted-by":"publisher","unstructured":"Pastore, F., Micucci, D., Mariani, L.: Timed k-tail: automatic inference of timed automata. In: 2017 IEEE International Conference on Software Testing, Verification and Validation (ICST), pp. 401\u2013411. IEEE, New York, March 2017. https:\/\/doi.org\/10.1109\/ICST.2017.43, ICST 2017","DOI":"10.1109\/ICST.2017.43"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-030-29662-9_13","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"M Tappler","year":"2019","unstructured":"Tappler, M., Aichernig, B.K., Larsen, K.G., Lorber, F.: Time to learn \u2013 learning timed automata from tests. In: Andr\u00e9, \u00c9., Stoelinga, M. (eds.) FORMATS 2019. LNCS, vol. 11750, pp. 216\u2013235. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29662-9_13"},{"key":"7_CR25","doi-asserted-by":"publisher","unstructured":"Tappler, M., Aichernig, B.K., Lorber, F.: Timed automata learning via SMT solving. In: Deshmukh, J.V., Havelund, K., Perez, I. (eds.) NASA Formal Methods. NFM 2022. LNCS, vol. 13260, pp. 489\u2013507. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06773-0_26","DOI":"10.1007\/978-3-031-06773-0_26"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-030-68195-1_13","volume-title":"Language and Automata Theory and Applications","author":"F Vaandrager","year":"2021","unstructured":"Vaandrager, F., Bloem, R., Ebrahimi, M.: Learning mealy machines with one timer. In: Leporati, A., Mart\u00edn-Vide, C., Shapira, D., Zandron, C. (eds.) LATA 2021. LNCS, vol. 12638, pp. 157\u2013170. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-68195-1_13"},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1007\/978-3-642-00982-2_63","volume-title":"Language and Automata Theory and Applications","author":"S Verwer","year":"2009","unstructured":"Verwer, S., de Weerdt, M., Witteveen, C.: One-clock deterministic timed automata are efficiently identifiable in the limit. In: Dediu, A.H., Ionescu, A.M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 740\u2013751. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00982-2_63"},{"issue":"3","key":"7_CR28","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10994-011-5265-4","volume":"86","author":"S Verwer","year":"2012","unstructured":"Verwer, S., de Weerdt, M., Witteveen, C.: Efficiently identifying deterministic real-time automata from labeled data. Mach. Learn. 86(3), 295\u2013333 (2012). https:\/\/doi.org\/10.1007\/s10994-011-5265-4","journal-title":"Mach. Learn."}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33170-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T12:56:46Z","timestamp":1685710606000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33170-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031331695","9783031331701"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33170-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"3 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"NASA Formal Methods Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Houston, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/nfm-2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.9","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}