{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T09:58:07Z","timestamp":1776333487489,"version":"3.51.2"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030451899","type":"print"},{"value":"9783030451905","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-45190-5_25","type":"book-chapter","created":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T09:03:02Z","timestamp":1587114182000},"page":"444-462","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Learning One-Clock Timed Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9260-9697","authenticated-orcid":false,"given":"Jie","family":"An","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9663-7441","authenticated-orcid":false,"given":"Mingshuai","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5377-9351","authenticated-orcid":false,"given":"Bohua","family":"Zhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3298-3817","authenticated-orcid":false,"given":"Naijun","family":"Zhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miaomiao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,17]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","unstructured":"Aarts, F., Fiterau-Brostean, P., Kuppens, H., Vaandrager, F.W.: Learning register automata with fresh value generation. In: Leucker, M., Rueda, C., Valencia, F.D. (eds.) ICTAC 2015. LNCS, vol.\u00a09399, pp. 165\u2013183. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-25150-9_11","DOI":"10.1007\/978-3-319-25150-9_11"},{"key":"25_CR2","doi-asserted-by":"publisher","unstructured":"Aarts, F., Vaandrager, F.W.: Learning I\/O automata. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol.\u00a06269, pp. 71\u201385. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-15375-4_6","DOI":"10.1007\/978-3-642-15375-4_6"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Abdullah, J., Dai, G., Mohaqeqi, M., Yi, W.: Schedulability analysis and software synthesis for graph-based task models with resource sharing. In: Proceedings of 24th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2018. pp. 261\u2013270. IEEE Computer Society (2018)","DOI":"10.1109\/RTAS.2018.00034"},{"key":"25_CR4","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183\u2013235 (1994)"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Alur, R., Fix, L., Henzinger, T.A.: Event-clock automata: A determinizable class of timed automata. Theor. Comput. Sci. 211(1-2), 253\u2013273 (1999)","DOI":"10.1016\/S0304-3975(97)00173-4"},{"key":"25_CR6","doi-asserted-by":"publisher","unstructured":"Alur, R., Madhusudan, P.: Decision problems for timed automata: A survey. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol.\u00a03185, pp. 1\u201324. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-30080-9_1","DOI":"10.1007\/978-3-540-30080-9_1"},{"key":"25_CR7","unstructured":"An, J., Chen, M., Zhan, B., Zhan, N., Zhang, M.: Learning one-clock timed automata (full version). \narXiv:1910.10680\n\n (2019), \nhttps:\/\/arxiv.org\/abs\/1910.10680"},{"key":"25_CR8","unstructured":"An, J., Chen, M., Zhan, B., Zhan, N., Zhang, M.: Learning one-clock timed automata. Figshare (2020), \nhttps:\/\/doi.org\/10.6084\/m9.figshare.11545983.v3"},{"key":"25_CR9","doi-asserted-by":"publisher","unstructured":"An, J., Wang, L., Zhan, B., Zhan, N., Zhang, M.: Learning real-time automata. SCIENCE CHINA Information Sciences (2020). \nhttps:\/\/doi.org\/10.1007\/s11432-019-2767-4\n\n, to appear.","DOI":"10.1007\/s11432-019-2767-4"},{"key":"25_CR10","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87\u2013106 (1987)"},{"key":"25_CR11","doi-asserted-by":"publisher","unstructured":"Argyros, G., D\u2019Antoni, L.: The learnability of symbolic automata. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10981, pp. 427\u2013445. Springer, Heidelberg (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-96145-3_23","DOI":"10.1007\/978-3-319-96145-3_23"},{"key":"25_CR12","unstructured":"Bollig, B., Habermehl, P., Kern, C., Leucker, M.: Angluin-style learning of NFA. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence, IJCAI 2009. pp. 1004\u20131009. AAAI Press (2009)"},{"key":"25_CR13","doi-asserted-by":"publisher","unstructured":"Bollig, B., Katoen, J.P., Kern, C., Leucker, M., Neider, D., Piegdon, D.R.: libalf: The automata learning framework. In: Touili, T., Cook, B., Jackson, P.B. (eds.) CAV 2010. LNCS, vol.\u00a06174, pp. 360\u2013364. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-14295-6_32","DOI":"10.1007\/978-3-642-14295-6_32"},{"key":"25_CR14","unstructured":"Caldwell, B., Cardell-Oliver, R., French, T.: Learning time delay Mealy machines from programmable logic controllers. IEEE Trans. Automation Science and Engineering 13(2), 1155\u20131164 (2016)"},{"key":"25_CR15","unstructured":"Cassel, S., Howar, F., Jonsson, B., Steffen, B.: Active learning for extended finite state machines. Formal Asp. Comput. 28(2), 233\u2013263 (2016)"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Denning, D.E., Sacco, G.M.: Timestamps in key distribution protocols. Communications of the ACM 24(8), 533\u2013536 (1981)","DOI":"10.1145\/358722.358740"},{"key":"25_CR17","unstructured":"Dima, C.: Real-time automata. Journal of Automata, Languages and Combinatorics 6(1), 3\u201323 (2001)"},{"key":"25_CR18","doi-asserted-by":"publisher","unstructured":"Drews, S., D\u2019Antoni, L.: Learning symbolic automata. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10205, pp. 173\u2013189. Springer, Heidelberg (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-662-54577-5_10","DOI":"10.1007\/978-3-662-54577-5_10"},{"key":"25_CR19","doi-asserted-by":"publisher","unstructured":"Farzan, A., Chen, Y., Clarke, E.M., Tsay, Y., Wang, B.: Extending automated compositional verification to the full class of omega-regular languages. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.\u00a04963, pp. 2\u201317. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-78800-3_2","DOI":"10.1007\/978-3-540-78800-3_2"},{"key":"25_CR20","doi-asserted-by":"publisher","unstructured":"Fiterau-Brostean, P., Janssen, R., Vaandrager, F.W.: Combining model learning and model checking to analyze TCP implementations. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol.\u00a09780, pp. 454\u2013471. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-41540-6_25","DOI":"10.1007\/978-3-319-41540-6_25"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Fiterau-Brostean, P., Lenaerts, T., Poll, E., de Ruiter, J., Vaandrager, F.W., Verleg, P.: Model learning and model checking of SSH implementations. In: Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, SPIN 2017. pp. 142\u2013151. ACM (2017)","DOI":"10.1145\/3092282.3092289"},{"key":"25_CR22","unstructured":"Grinchtein, O., Jonsson, B., Leucker, M.: Learning of event-recording automata. Theor. Comput. Sci. 411(47), 4029\u20134054 (2010)"},{"key":"25_CR23","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company (1979)"},{"key":"25_CR24","doi-asserted-by":"publisher","unstructured":"Howar, F., Jonsson, B., Vaandrager, F.W.: Combining black-box and white-box techniques for learning register automata. In: Steffen, B., Woeginger, G.J. (eds.) Computing and Software Science - State of the Art and Perspectives, LNCS, vol. 10000, pp. 563\u2013588. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-319-91908-9_26","DOI":"10.1007\/978-3-319-91908-9_26"},{"key":"25_CR25","doi-asserted-by":"publisher","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-27940-9_17","DOI":"10.1007\/978-3-642-27940-9_17"},{"key":"25_CR26","unstructured":"Information Science Institute, University of Southern California: Transmission control protocol (DARPA internet program protocol specification). \nhttps:\/\/www.rfc-editor.org\/rfc\/rfc793.txt\n\n (1981)"},{"key":"25_CR27","doi-asserted-by":"publisher","unstructured":"Isberner, M., Howar, F., Steffen, B.: The open-source LearnLib - A framework for active automata learning. In: Kroening, D., Pasareanu, C.S. (eds.) CAV 2015. LNCS, vol.\u00a09206, pp. 487\u2013495. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-21690-4_32","DOI":"10.1007\/978-3-319-21690-4_32"},{"key":"25_CR28","doi-asserted-by":"publisher","unstructured":"Li, Y., Chen, Y., Zhang, L., Liu, D.: A novel learning algorithm for B\u00fcchi automata based on family of DFAs and classification trees. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10205, pp. 208\u2013226. Springer, Heidelberg (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-662-54577-5_12","DOI":"10.1007\/978-3-662-54577-5_12"},{"key":"25_CR29","doi-asserted-by":"publisher","unstructured":"Maler, O., Mens, I.: Learning regular languages over large alphabets. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol.\u00a08413, pp. 485\u2013499. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-642-54862-8_41","DOI":"10.1007\/978-3-642-54862-8_41"},{"key":"25_CR30","doi-asserted-by":"crossref","unstructured":"Margaria, T., Niese, O., Raffelt, H., Steffen, B.: Efficient test-based model generation for legacy reactive systems. In: Proceedings of the 9th IEEE International High-Level Design Validation and Test Workshop, HLDVT 2004. pp. 95\u2013100. IEEE Computer Society (2004)","DOI":"10.1109\/HLDVT.2004.1431246"},{"key":"25_CR31","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: On the language inclusion problem for timed automata: Closing a decidability gap. In: Proceedings of the 19th IEEE Symposium on Logic in Computer Science, LICS 2004. pp. 54\u201363. IEEE Computer Society (2004)","DOI":"10.1109\/LICS.2004.1319600"},{"key":"25_CR32","doi-asserted-by":"crossref","unstructured":"Pastore, F., Micucci, D., Mariani, L.: Timed k-Tail: Automatic inference of timed automata. In: Proceedings of 10th IEEE International Conference on Software Testing, Verification and Validation, ICST 2017. pp. 401\u2013411. IEEE Computer Society (2017)","DOI":"10.1109\/ICST.2017.43"},{"key":"25_CR33","doi-asserted-by":"crossref","unstructured":"Schmidt, J., Ghorbani, A., Hapfelmeier, A., Kramer, S.: Learning probabilistic real-time automata from multi-attribute event logs. Intell. Data Anal. 17(1), 93\u2013123 (2013)","DOI":"10.3233\/IDA-120569"},{"key":"25_CR34","doi-asserted-by":"publisher","unstructured":"Shahbaz, M., Groz, R.: Inferring Mealy machines. In: Cavalcanti, A., Dams, D. (eds.) FM 2009. LNCS, vol.\u00a05850, pp. 207\u2013222. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-05089-3_14","DOI":"10.1007\/978-3-642-05089-3_14"},{"key":"25_CR35","doi-asserted-by":"crossref","unstructured":"Stigge, M., Ekberg, P., Guan, N., Yi, W.: The digraph real-time task model. In: Proceedings of 17th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2011. pp. 71\u201380. IEEE Computer Society (2011)","DOI":"10.1109\/RTAS.2011.15"},{"key":"25_CR36","doi-asserted-by":"publisher","unstructured":"Tappler, M., Aichernig, B.K., Bacci, G., Eichlseder, M., Larsen, K.G.: $${L}^*$$-based learning of Markov decision processes. In: ter Beek, M.H., McIver, A., Oliveira, J.N. (eds.) FM 2019. LNCS, vol. 11800, pp. 651\u2013669. Springer, Heidelberg (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-30942-8_38","DOI":"10.1007\/978-3-030-30942-8_38"},{"key":"25_CR37","doi-asserted-by":"publisher","unstructured":"Tappler, M., Aichernig, B.K., Larsen, K.G., Lorber, F.: Time to learn - learning timed automata from tests. In: Andr\u00e9, \u00c9., Stoelinga, M. (eds.) FORMATS 2019. LNCS, vol. 11750, pp. 216\u2013235. Springer, Heidelberg (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-29662-9_13","DOI":"10.1007\/978-3-030-29662-9_13"},{"key":"25_CR38","doi-asserted-by":"crossref","unstructured":"Vaandrager, F.W.: Model learning. Communications of the ACM 60(2), 86\u201395 (2017)","DOI":"10.1145\/2967606"},{"key":"25_CR39","doi-asserted-by":"publisher","unstructured":"Verwer, S., de\u00a0Weerdt, M., Witteveen, C.: One-clock deterministic timed automata are efficiently identifiable in the limit. In: Dediu, A., Ionescu, A., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol.\u00a05457, pp. 740\u2013751. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-00982-2_63","DOI":"10.1007\/978-3-642-00982-2_63"},{"key":"25_CR40","doi-asserted-by":"crossref","unstructured":"Verwer, S., de\u00a0Weerdt, M., Witteveen, C.: The efficiency of identifying timed automata and the power of clocks. Information and Computation 209(3), 606\u2013625 (2011)","DOI":"10.1016\/j.ic.2010.11.023"},{"key":"25_CR41","doi-asserted-by":"crossref","unstructured":"Verwer, S., de\u00a0Weerdt, M., Witteveen, C.: Efficiently identifying deterministic real-time automata from labeled data. Machine Learning 86(3), 295\u2013333 (2012)","DOI":"10.1007\/s10994-011-5265-4"},{"key":"25_CR42","unstructured":"Verwer, S., Weerdt, M.D., Witteveen, C.: An algorithm for learning real-time automata. In: Proceedings of the 18th Annual Machine Learning Conference of Belgium and the Netherlands, Benelearn 2007. pp. 57\u201364 (2007)"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45190-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T13:14:01Z","timestamp":1597929241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45190-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030451899","9783030451905"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45190-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"17 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TACAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dublin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2020\/tacas","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":"155","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":"40","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":"8","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":"26% - 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","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":"14","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)"}},{"value":"The conference could not take place due to the COVID-19 pandemic. There was an online event on July 2, 2020.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}