{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T18:41:51Z","timestamp":1767984111853,"version":"3.49.0"},"publisher-location":"Cham","reference-count":83,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032107930","type":"print"},{"value":"9783032107947","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,16]],"date-time":"2025-11-16T00:00:00Z","timestamp":1763251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,16]],"date-time":"2025-11-16T00:00:00Z","timestamp":1763251200000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-10794-7_23","type":"book-chapter","created":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T06:43:20Z","timestamp":1763189000000},"page":"461-484","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Automata Learning \u2013 Expect Delays!"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4217-4952","authenticated-orcid":false,"given":"Gabriel","family":"Dengler","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3687-2233","authenticated-orcid":false,"given":"Sven","family":"Apel","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2766-9615","authenticated-orcid":false,"given":"Holger","family":"Hermanns","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,16]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183\u2013235 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)90010-8, https:\/\/doi.org\/10.1016\/0304-3975(94)90010-8","DOI":"10.1016\/0304-3975(94)90010-8"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"An, J., Chen, M., Zhan, B., Zhan, N., Zhang, M.: Learning One-Clock Timed Automata. In: Biere, A., Parker, D. (eds.) Tools and Algorithms for the Construction and Analysis of Systems. pp. 444\u2013462. Springer International Publishing, Cham (2020)","DOI":"10.1007\/978-3-030-45190-5_25"},{"key":"23_CR3","doi-asserted-by":"publisher","unstructured":"An, J., Wang, L., Zhan, B., Zhan, N., Zhang, M.: Learning real-time automata. Science China Information Sciences 64(9), 192103 (Aug 2021). https:\/\/doi.org\/10.1007\/s11432-019-2767-4, https:\/\/doi.org\/10.1007\/s11432-019-2767-4","DOI":"10.1007\/s11432-019-2767-4"},{"key":"23_CR4","doi-asserted-by":"publisher","unstructured":"An, J., Zhan, B., Zhan, N., Zhang, M.: Learning nondeterministic real-time automata. ACM Trans. Embed. Comput. Syst. 20(5s) (Sep 2021). https:\/\/doi.org\/10.1145\/3477030, https:\/\/doi.org\/10.1145\/3477030","DOI":"10.1145\/3477030"},{"key":"23_CR5","doi-asserted-by":"publisher","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75(2), 87\u2013106 (1987). https:\/\/doi.org\/10.1016\/0890-5401(87)90052-6, https:\/\/www.sciencedirect.com\/science\/article\/pii\/0890540187900526","DOI":"10.1016\/0890-5401(87)90052-6"},{"key":"23_CR6","doi-asserted-by":"publisher","unstructured":"Ashok, P., Kret\u00ednsk\u00fd, J., Weininger, M.: PAC Statistical Model Checking for Markov Decision Processes and Stochastic Games. In: Dillig, I., Tasiran, S. (eds.) Computer Aided Verification - 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part I. Lecture Notes in Computer Science, vol. 11561, pp. 497\u2013519. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-25540-4_29, https:\/\/doi.org\/10.1007\/978-3-030-25540-4_29","DOI":"10.1007\/978-3-030-25540-4_29"},{"key":"23_CR7","unstructured":"Asmussen, S., Nerman, O., Olsson, M.: Fitting phase-type distributions via the EM algorithm. Scandinavian Journal of Statistics 23(4), 419\u2013441 (1996), http:\/\/www.jstor.org\/stable\/4616418"},{"key":"23_CR8","doi-asserted-by":"publisher","unstructured":"Bacci, G., Ing\u00f3lfsd\u00f3ttir, A., Larsen, K.G., Reynouard, R.: Active Learning of Markov Decision Processes using Baum-Welch algorithm. In: Wani, M.A., Sethi, I.K., Shi, W., Qu, G., Raicu, D.S., Jin, R. (eds.) 20th IEEE International Conference on Machine Learning and Applications, ICMLA 2021, Pasadena, CA, USA, December 13-16, 2021. pp. 1203\u20131208. IEEE (2021). https:\/\/doi.org\/10.1109\/ICMLA52953.2021.00195, https:\/\/doi.org\/10.1109\/ICMLA52953.2021.00195","DOI":"10.1109\/ICMLA52953.2021.00195"},{"key":"23_CR9","unstructured":"Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.: Reachability in continuous-time markov reward decision processes. In: Flum, J., Gr\u00e4del, E., Wilke, T. (eds.) Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]. Texts in Logic and Games, vol.\u00a02, pp. 53\u201372. Amsterdam University Press (2008)"},{"key":"23_CR10","doi-asserted-by":"publisher","unstructured":"Bertrand, N., Bouyer, P., Brihaye, T., Menet, Q., Baier, C., Gr\u00f6\u00dfer, M., Jurdzinski, M.: Stochastic Timed Automata. Log. Methods Comput. Sci. 10(4) (2014). https:\/\/doi.org\/10.2168\/LMCS-10(4:6)2014, https:\/\/doi.org\/10.2168\/LMCS-10(4:6)2014","DOI":"10.2168\/LMCS-10(4:6)2014"},{"key":"23_CR11","unstructured":"Biggs, N., Lloyd, E.K., Wilson, R.J.: Graph Theory, 1736-1936. Oxford University Press (1986)"},{"key":"23_CR12","doi-asserted-by":"publisher","unstructured":"Bobbio, A., Andr\u00e1s Horv\u00e1th and Mikl\u00f3s Telek: Matching three moments with minimal acyclic phase type distributions. Stochastic Models 21(2-3), 303\u2013326 (2005). https:\/\/doi.org\/10.1081\/STM-200056210","DOI":"10.1081\/STM-200056210"},{"key":"23_CR13","doi-asserted-by":"publisher","unstructured":"Bruy\u00e8re, V., Garhewal, B., P\u00e9rez, G.A., Staquet, G., Vaandrager, F.W.: Active Learning of Mealy Machines with Timers. CoRR abs\/2403.02019 (2024). https:\/\/doi.org\/10.48550\/ARXIV.2403.02019, https:\/\/doi.org\/10.48550\/arXiv.2403.02019","DOI":"10.48550\/ARXIV.2403.02019"},{"key":"23_CR14","doi-asserted-by":"publisher","unstructured":"Buchholz, P., Dohndorf, I., Kriege, J.: An online approach to estimate parameters of phase-type distributions. In: 2019 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN). pp. 100\u2013111 (June 2019). https:\/\/doi.org\/10.1109\/DSN.2019.00024","DOI":"10.1109\/DSN.2019.00024"},{"key":"23_CR15","doi-asserted-by":"publisher","unstructured":"Caldwell, B., Cardell-Oliver, R., French, T.: Learning Time Delay Mealy Machines From Programmable Logic Controllers. IEEE Trans Autom. Sci. Eng. 13(2), 1155\u20131164 (2016). https:\/\/doi.org\/10.1109\/TASE.2015.2496242, https:\/\/doi.org\/10.1109\/TASE.2015.2496242","DOI":"10.1109\/TASE.2015.2496242"},{"key":"23_CR16","doi-asserted-by":"publisher","unstructured":"Carrasco, R.C., Oncina, J.: Learning Stochastic Regular Grammars by Means of a State Merging Method. In: Carrasco, R.C., Oncina, J. (eds.) Grammatical Inference and Applications, Second International Colloquium, ICGI-94, Alicante, Spain, September 21-23, 1994, Proceedings. Lecture Notes in Computer Science, vol.\u00a0862, pp. 139\u2013152. Springer (1994). https:\/\/doi.org\/10.1007\/3-540-58473-0_144, https:\/\/doi.org\/10.1007\/3-540-58473-0_144","DOI":"10.1007\/3-540-58473-0_144"},{"key":"23_CR17","doi-asserted-by":"publisher","unstructured":"Chow, T.: Testing Software Design Modeled by Finite-State Machines. IEEE Transactions on Software Engineering SE-4(3), 178\u2013187 (1978). https:\/\/doi.org\/10.1109\/TSE.1978.231496","DOI":"10.1109\/TSE.1978.231496"},{"key":"23_CR18","unstructured":"Chu, Y.J.: On the shortest arborescence of a directed graph. Sci. Sinica 14, 1396\u20131400 (1965)"},{"key":"23_CR19","unstructured":"Dantzig, G.B.: Application of the simplex method to a transportation problem. Activity analysis and production and allocation (1951)"},{"key":"23_CR20","doi-asserted-by":"publisher","unstructured":"D\u2019Argenio, P.R., Katoen, J.: A theory of stochastic systems part I: Stochastic automata. Inf. Comput. 203(1), 1\u201338 (2005). https:\/\/doi.org\/10.1016\/J.IC.2005.07.001, https:\/\/doi.org\/10.1016\/j.ic.2005.07.001","DOI":"10.1016\/J.IC.2005.07.001"},{"key":"23_CR21","doi-asserted-by":"publisher","unstructured":"David, A., Larsen, K.G., Legay, A., Nyman, U., Wasowski, A.: Timed I\/O automata: a complete specification theory for real-time systems. In: Johansson, K.H., Yi, W. (eds.) Proceedings of the 13th ACM International Conference on Hybrid Systems: Computation and Control, HSCC 2010, Stockholm, Sweden, April 12-15, 2010. pp. 91\u2013100. ACM (2010). https:\/\/doi.org\/10.1145\/1755952.1755967, https:\/\/doi.org\/10.1145\/1755952.1755967","DOI":"10.1145\/1755952.1755967"},{"key":"23_CR22","doi-asserted-by":"publisher","unstructured":"Deng, Y., Hennessy, M.: On the semantics of Markov automata. Inf. Comput. 222, 139\u2013168 (2013). https:\/\/doi.org\/10.1016\/J.IC.2012.10.010, https:\/\/doi.org\/10.1016\/j.ic.2012.10.010","DOI":"10.1016\/J.IC.2012.10.010"},{"key":"23_CR23","doi-asserted-by":"publisher","unstructured":"Dengler, G., Apel, S., Hermanns, H.: Automata Learning \u2013 Expect Delays! CoRR abs\/2508.16384 (2025). https:\/\/doi.org\/10.48550\/ARXIV.2508.16384, https:\/\/doi.org\/10.48550\/arXiv.2508.16384","DOI":"10.48550\/ARXIV.2508.16384"},{"key":"23_CR24","doi-asserted-by":"publisher","unstructured":"Dvoretzky, A., Kiefer, J., Wolfowitz, J.: Asymptotic Minimax Character of the Sample Distribution Function and of the Classical Multinomial Estimator. The Annals of Mathematical Statistics 27(3), 642 \u2013 669 (1956). https:\/\/doi.org\/10.1214\/aoms\/1177728174, https:\/\/doi.org\/10.1214\/aoms\/1177728174","DOI":"10.1214\/aoms\/1177728174"},{"key":"23_CR25","doi-asserted-by":"publisher","unstructured":"Edmonds, J., Johnson, E.L.: Matching, Euler tours and the Chinese postman. Mathematical Programming 5(1), 88\u2013124 (Dec 1973). https:\/\/doi.org\/10.1007\/BF01580113, https:\/\/doi.org\/10.1007\/BF01580113","DOI":"10.1007\/BF01580113"},{"issue":"4","key":"23_CR26","doi-asserted-by":"publisher","first-page":"233","DOI":"10.6028\/jres.071B.032","volume":"71","author":"J Edmonds","year":"1967","unstructured":"Edmonds, J., et al.: Optimum branchings. Journal of Research of the national Bureau of Standards B 71(4), 233\u2013240 (1967)","journal-title":"Journal of Research of the national Bureau of Standards B"},{"issue":"3","key":"23_CR27","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1287\/opre.43.3.399","volume":"43","author":"HA Eiselt","year":"1995","unstructured":"Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems, part ii: The rural postman problem. Oper. Res. 43(3), 399\u2013414 (1995)","journal-title":"Oper. Res."},{"key":"23_CR28","doi-asserted-by":"publisher","unstructured":"Eisentraut, C., Hermanns, H., Zhang, L.: On Probabilistic Automata in Continuous Time. In: Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, 11-14 July 2010, Edinburgh, United Kingdom. pp. 342\u2013351. IEEE Computer Society (2010). https:\/\/doi.org\/10.1109\/LICS.2010.41, https:\/\/doi.org\/10.1109\/LICS.2010.41","DOI":"10.1109\/LICS.2010.41"},{"issue":"3\u20134","key":"23_CR29","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0166-5316(97)00003-5","volume":"31","author":"A Feldmann","year":"1998","unstructured":"Feldmann, A., Whitt, W.: Fitting mixtures of exponentials to long-tail distributions to analyze network. Perform. Evaluation 31(3\u20134), 245\u2013279 (1998). https:\/\/doi.org\/10.1016\/S0166-5316(97)00003-5","journal-title":"Perform. Evaluation"},{"key":"23_CR30","unstructured":"Feller, W.: An introduction to probability theory and its applications, Volume 2, vol.\u00a081. John Wiley & Sons (1991)"},{"key":"23_CR31","doi-asserted-by":"publisher","unstructured":"Ferreira, T., Brewton, H., D\u2019Antoni, L., Silva, A.: Prognosis: closed-box analysis of network protocol implementations. In: Proceedings of the 2021 ACM SIGCOMM 2021 Conference. p. 762\u2013774. SIGCOMM \u201921, Association for Computing Machinery, New York, NY, USA (2021). https:\/\/doi.org\/10.1145\/3452296.3472938, https:\/\/doi.org\/10.1145\/3452296.3472938","DOI":"10.1145\/3452296.3472938"},{"key":"23_CR32","doi-asserted-by":"publisher","unstructured":"Hartmanns, A., Hermanns, H.: In the quantitative automata zoo. Sci. Comput. Program. 112, 3\u201323 (2015). https:\/\/doi.org\/10.1016\/J.SCICO.2015.08.009, https:\/\/doi.org\/10.1016\/j.scico.2015.08.009","DOI":"10.1016\/J.SCICO.2015.08.009"},{"key":"23_CR33","doi-asserted-by":"publisher","unstructured":"Henderson, K., Gallagher, B., Eliassi-Rad, T.: EP-MEANS: an efficient nonparametric clustering of empirical probability distributions. In: Wainwright, R.L., Corchado, J.M., Bechini, A., Hong, J. (eds.) Proceedings of the 30th Annual ACM Symposium on Applied Computing, Salamanca, Spain, April 13-17, 2015. pp. 893\u2013900. ACM (2015). https:\/\/doi.org\/10.1145\/2695664.2695860, https:\/\/doi.org\/10.1145\/2695664.2695860","DOI":"10.1145\/2695664.2695860"},{"key":"23_CR34","doi-asserted-by":"publisher","unstructured":"Henry, L., J\u00e9ron, T., Markey, N.: Active Learning of Timed Automata with Unobservable Resets. In: Bertrand, N., Jansen, N. (eds.) Formal Modeling and Analysis of Timed Systems - 18th International Conference, FORMATS 2020, Vienna, Austria, September 1-3, 2020, Proceedings. Lecture Notes in Computer Science, vol. 12288, pp. 144\u2013160. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-57628-8_9, https:\/\/doi.org\/10.1007\/978-3-030-57628-8_9","DOI":"10.1007\/978-3-030-57628-8_9"},{"key":"23_CR35","doi-asserted-by":"publisher","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58(301), 13\u201330 (1963). https:\/\/doi.org\/10.1080\/01621459.1963.10500830, https:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/01621459.1963.10500830","DOI":"10.1080\/01621459.1963.10500830"},{"key":"23_CR36","doi-asserted-by":"publisher","unstructured":"Horv\u00e1th, A., Telek, M.: Phfit: A general phase-type fitting tool. In: Field, T., Harrison, P.G., Bradley, J.T., Harder, U. (eds.) Computer Performance Evaluation, Modelling Techniques and Tools 12th International Conference, TOOLS 2002, London, UK, April 14-17, 2002, Proceedings. Lecture Notes in Computer Science, vol.\u00a02324, pp. 82\u201391. Springer (2002). https:\/\/doi.org\/10.1007\/3-540-46029-2_5","DOI":"10.1007\/3-540-46029-2_5"},{"issue":"2","key":"23_CR37","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1080\/15326340701300712","volume":"23","author":"A Horv\u00e1th","year":"2007","unstructured":"Horv\u00e1th, A., Telek, M.: Matching more than three moments with acyclic phase type distributions. Stoch. Model. 23(2), 167\u2013194 (2007). https:\/\/doi.org\/10.1080\/15326340701300712","journal-title":"Stoch. Model."},{"key":"23_CR38","doi-asserted-by":"publisher","unstructured":"Horv\u00e1th, G.: Moment matching-based distribution fitting with generalized hyper-erlang distributions. In: Dudin, A.N., Turck, K.D. (eds.) Analytical and Stochastic Modelling Techniques and Applications - 20th International Conference, ASMTA 2013, Ghent, Belgium, July 8-10, 2013. Proceedings. Lecture Notes in Computer Science, vol.\u00a07984, pp. 232\u2013246. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-39408-9_17","DOI":"10.1007\/978-3-642-39408-9_17"},{"key":"23_CR39","doi-asserted-by":"publisher","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.) Runtime Verification - 5th International Conference, RV 2014, Toronto, ON, Canada, September 22-25, 2014. Proceedings. Lecture Notes in Computer Science, vol.\u00a08734, pp. 307\u2013322. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-319-11164-3_26, https:\/\/doi.org\/10.1007\/978-3-319-11164-3_26","DOI":"10.1007\/978-3-319-11164-3_26"},{"issue":"4","key":"23_CR40","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1080\/15326348908807131","volume":"5","author":"MA Johnson","year":"1989","unstructured":"Johnson, M.A., Taaffe, M.R.: Matching moments to phase distributions: Mixtures of erlang distributions of common order. Communications in Statistics. Stochastic Models 5(4), 711\u2013743 (1989). https:\/\/doi.org\/10.1080\/15326348908807131","journal-title":"Communications in Statistics. Stochastic Models"},{"key":"23_CR41","unstructured":"Jonsson, B., Vaandrager, F.: Learning Mealy machines with timers. Tech. rep., Tech. rep (2018)"},{"issue":"2\u20133","key":"23_CR42","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0166-5316(02)00179-7","volume":"52","author":"REA Khayari","year":"2003","unstructured":"Khayari, R.E.A., Sadre, R., Haverkort, B.R.: Fitting world-wide web request traces with the em-algorithm. Perform. Evaluation 52(2\u20133), 175\u2013191 (2003). https:\/\/doi.org\/10.1016\/S0166-5316(02)00179-7","journal-title":"Perform. Evaluation"},{"key":"23_CR43","unstructured":"Kir\u00e1ly, Z., Kov\u00e1cs, P.: Efficient implementations of minimum-cost flow algorithms. arXiv preprint arXiv:1207.6381 (2012)"},{"key":"23_CR44","doi-asserted-by":"publisher","unstructured":"Kogel, P., Kl\u00f6s, V., Glesner, S.: Learning Mealy Machines with Local Timers. In: Li, Y., Tahar, S. (eds.) Formal Methods and Software Engineering - 24th International Conference on Formal Engineering Methods, ICFEM 2023, Brisbane, QLD, Australia, November 21-24, 2023, Proceedings. Lecture Notes in Computer Science, vol. 14308, pp. 47\u201364. Springer (2023). https:\/\/doi.org\/10.1007\/978-981-99-7584-6_4, https:\/\/doi.org\/10.1007\/978-981-99-7584-6_4","DOI":"10.1007\/978-981-99-7584-6_4"},{"key":"23_CR45","doi-asserted-by":"crossref","unstructured":"Kruger, L., Junges, S., Rot, J.: Small Test Suites for Active Automata Learning. In: Finkbeiner, B., Kov\u00e1cs, L. (eds.) Tools and Algorithms for the Construction and Analysis of Systems. pp. 109\u2013129. Springer Nature Switzerland, Cham (2024)","DOI":"10.1007\/978-3-031-57249-4_6"},{"key":"23_CR46","doi-asserted-by":"publisher","unstructured":"L\u00f3pez, G.G.I., Hermanns, H., Katoen, J.: Beyond memoryless distributions: Model checking semi-markov chains. In: de\u00a0Alfaro, L., Gilmore, S. (eds.) Process Algebra and Probabilistic Methods, Performance Modeling and Verification: Joint International Workshop, PAPM-PROBMIV 2001, Aachen, Germany, September 12-14, 2001, Proceedings. Lecture Notes in Computer Science, vol.\u00a02165, pp. 57\u201370. Springer (2001). https:\/\/doi.org\/10.1007\/3-540-44804-7_4, https:\/\/doi.org\/10.1007\/3-540-44804-7_4","DOI":"10.1007\/3-540-44804-7_4"},{"key":"23_CR47","unstructured":"MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: Proceedings of 5-th Berkeley Symposium on Mathematical Statistics and Probability\/University of California Press (1967)"},{"key":"23_CR48","doi-asserted-by":"publisher","unstructured":"Mann, H.B., Whitney, D.R.: On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other. The Annals of Mathematical Statistics 18(1), 50 \u2013 60 (1947). https:\/\/doi.org\/10.1214\/aoms\/1177730491, https:\/\/doi.org\/10.1214\/aoms\/1177730491","DOI":"10.1214\/aoms\/1177730491"},{"key":"23_CR49","doi-asserted-by":"publisher","unstructured":"Mao, H., Chen, Y., Jaeger, M., Nielsen, T.D., Larsen, K.G., Nielsen, B.: Learning Markov Decision Processes for Model Checking. In: Fahrenberg, U., Legay, A., Thrane, C.R. (eds.) Proceedings Quantities in Formal Methods, QFM 2012, Paris, France, 28 August 2012. EPTCS, vol.\u00a0103, pp. 49\u201363 (2012). https:\/\/doi.org\/10.4204\/EPTCS.103.6, https:\/\/doi.org\/10.4204\/EPTCS.103.6","DOI":"10.4204\/EPTCS.103.6"},{"key":"23_CR50","doi-asserted-by":"publisher","unstructured":"Massart, P.: The Tight Constant in the Dvoretzky-Kiefer-Wolfowitz Inequality. The Annals of Probability 18(3), 1269 \u2013 1283 (1990). https:\/\/doi.org\/10.1214\/aop\/1176990746, https:\/\/doi.org\/10.1214\/aop\/1176990746","DOI":"10.1214\/aop\/1176990746"},{"key":"23_CR51","doi-asserted-by":"publisher","unstructured":"de\u00a0Matos\u00a0Pedro, A., Crocker, P.A., de\u00a0Sousa, S.M.: Learning Stochastic Timed Automata from Sample Executions. In: Margaria, T., Steffen, B. (eds.) Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change - 5th International Symposium, ISoLA 2012, Heraklion, Crete, Greece, October 15-18, 2012, Proceedings, Part I. Lecture Notes in Computer Science, vol.\u00a07609, pp. 508\u2013523. Springer (2012). https:\/\/doi.org\/10.1007\/978-3-642-34026-0_38, https:\/\/doi.org\/10.1007\/978-3-642-34026-0_38","DOI":"10.1007\/978-3-642-34026-0_38"},{"key":"23_CR52","doi-asserted-by":"publisher","unstructured":"Mediouni, B.L., Nouri, A., Bozga, M., Bensalem, S.: Improved Learning for Stochastic Timed Models by State-Merging Algorithms. In: Barrett, C.W., Davies, M.D., Kahsai, T. (eds.) NASA Formal Methods - 9th International Symposium, NFM 2017, Moffett Field, CA, USA, May 16-18, 2017, Proceedings. Lecture Notes in Computer Science, vol. 10227, pp. 178\u2013193 (2017). https:\/\/doi.org\/10.1007\/978-3-319-57288-8_13, https:\/\/doi.org\/10.1007\/978-3-319-57288-8_13","DOI":"10.1007\/978-3-319-57288-8_13"},{"key":"23_CR53","doi-asserted-by":"publisher","unstructured":"Meijer, J., van\u00a0de Pol, J.: Sound black-box checking in the LearnLib. Innov. Syst. Softw. Eng. 15(3-4), 267\u2013287 (2019). https:\/\/doi.org\/10.1007\/S11334-019-00342-6, https:\/\/doi.org\/10.1007\/s11334-019-00342-6","DOI":"10.1007\/S11334-019-00342-6"},{"key":"23_CR54","unstructured":"Mohri, M.: Foundations of machine learning (2018)"},{"key":"23_CR55","doi-asserted-by":"publisher","unstructured":"Mu\u0161kardin, E., Aichernig, B.K., Pill, I., Pferscher, A., Tappler, M.: AALpy: an active automata learning library. Innovations Syst. Softw. Eng. , 1\u201310 (2022). https:\/\/doi.org\/10.1007\/s11334-022-00449-3","DOI":"10.1007\/s11334-022-00449-3"},{"key":"23_CR56","doi-asserted-by":"publisher","unstructured":"Mu\u0161kardin, E., Tappler, M., Aichernig, B.K., Pill, I.: Active model learning of stochastic reactive systems (extended version). Softw. Syst. Model. 23(2), 503\u2013524 (2024). https:\/\/doi.org\/10.1007\/s10270-024-01158-0","DOI":"10.1007\/s10270-024-01158-0"},{"key":"23_CR57","doi-asserted-by":"publisher","unstructured":"Neider, D., Smetsers, R., Vaandrager, F., Kuppens, H.: Benchmarks for Automata Learning and Conformance Testing, pp. 390\u2013416. Springer International Publishing, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-22348-9_23","DOI":"10.1007\/978-3-030-22348-9_23"},{"key":"23_CR58","doi-asserted-by":"publisher","unstructured":"Nicollin, X., Sifakis, J.: An overview and synthesis on timed process algebras. In: Larsen, K.G., Skou, A. (eds.) Computer Aided Verification, 3rd International Workshop, CAV \u201991, Aalborg, Denmark, July, 1-4, 1991, Proceedings. Lecture Notes in Computer Science, vol.\u00a0575, pp. 376\u2013398. Springer (1991). https:\/\/doi.org\/10.1007\/3-540-55179-4_36, https:\/\/doi.org\/10.1007\/3-540-55179-4_36","DOI":"10.1007\/3-540-55179-4_36"},{"key":"23_CR59","unstructured":"Nielsen, F.: A family of statistical symmetric divergences based on jensen\u2019s inequality. CoRR abs\/1009.4004 (2010), http:\/\/arxiv.org\/abs\/1009.4004"},{"key":"23_CR60","doi-asserted-by":"publisher","unstructured":"Panchenko, A., Th\u00fcmmler, A.: Efficient phase-type fitting with aggregated traffic traces. Perform. Evaluation 64(7-8), 629\u2013645 (2007). https:\/\/doi.org\/10.1016\/J.PEVA.2006.09.002, https:\/\/doi.org\/10.1016\/j.peva.2006.09.002","DOI":"10.1016\/J.PEVA.2006.09.002"},{"key":"23_CR61","doi-asserted-by":"publisher","unstructured":"Park, D.M.R.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) Theoretical Computer Science, 5th GI-Conference, Karlsruhe, Germany, March 23-25, 1981, Proceedings. Lecture Notes in Computer Science, vol.\u00a0104, pp. 167\u2013183. Springer (1981). https:\/\/doi.org\/10.1007\/BFB0017309, https:\/\/doi.org\/10.1007\/BFb0017309","DOI":"10.1007\/BFB0017309"},{"key":"23_CR62","doi-asserted-by":"publisher","unstructured":"Pearn, W., Wu, T.: Algorithms for the rural postman problem. Computers & Operations Research 22(8), 819\u2013828 (1995). https:\/\/doi.org\/10.1016\/0305-0548(94)00070-O, https:\/\/www.sciencedirect.com\/science\/article\/pii\/030505489400070O","DOI":"10.1016\/0305-0548(94)00070-O"},{"key":"23_CR63","doi-asserted-by":"publisher","unstructured":"Peled, D., Vardi, M.Y., Yannakakis, M.: Black Box Checking, pp. 225\u2013240. Springer US, Boston, MA (1999). https:\/\/doi.org\/10.1007\/978-0-387-35578-8_13, https:\/\/doi.org\/10.1007\/978-0-387-35578-8_13","DOI":"10.1007\/978-0-387-35578-8_13"},{"key":"23_CR64","doi-asserted-by":"publisher","unstructured":"Rubner, Y., Tomasi, C., Guibas, L.J.: A metric for distributions with applications to image databases. In: Proceedings of the Sixth International Conference on Computer Vision (ICCV-98), Bombay, India, January 4-7, 1998. pp. 59\u201366. IEEE Computer Society (1998). https:\/\/doi.org\/10.1109\/ICCV.1998.710701, https:\/\/doi.org\/10.1109\/ICCV.1998.710701","DOI":"10.1109\/ICCV.1998.710701"},{"key":"23_CR65","unstructured":"Segala, R., Lynch, N.A.: Probabilistic simulations for probabilistic processes. Nord. J. Comput. 2(2), 250\u2013273 (1995)"},{"key":"23_CR66","doi-asserted-by":"publisher","unstructured":"Sen, K., Viswanathan, M., Agha, G.: Learning Continuous Time Markov Chains from Sample Executions. In: 1st International Conference on Quantitative Evaluation of Systems (QEST 2004), 27-30 September 2004, Enschede, The Netherlands. pp. 146\u2013155. IEEE Computer Society (2004). https:\/\/doi.org\/10.1109\/QEST.2004.1348029, https:\/\/doi.org\/10.1109\/QEST.2004.1348029","DOI":"10.1109\/QEST.2004.1348029"},{"key":"23_CR67","doi-asserted-by":"publisher","unstructured":"Shijubo, J., Waga, M., Suenaga, K.: Probabilistic black-box checking via active MDP learning. ACM Trans. Embed. Comput. Syst. 22(5s), 148:1\u2013148:26 (2023). https:\/\/doi.org\/10.1145\/3609127, https:\/\/doi.org\/10.1145\/3609127","DOI":"10.1145\/3609127"},{"key":"23_CR68","doi-asserted-by":"publisher","unstructured":"Siegmund, J., Siegmund, N., Apel, S.: Views on internal and external validity in empirical software engineering. In: Bertolino, A., Canfora, G., Elbaum, S.G. (eds.) 37th IEEE\/ACM International Conference on Software Engineering, ICSE 2015, Florence, Italy, May 16-24, 2015, Volume 1. pp. 9\u201319. IEEE Computer Society (2015). https:\/\/doi.org\/10.1109\/ICSE.2015.24, https:\/\/doi.org\/10.1109\/ICSE.2015.24","DOI":"10.1109\/ICSE.2015.24"},{"key":"23_CR69","doi-asserted-by":"publisher","unstructured":"Smirnov, N.: Table for Estimating the Goodness of Fit of Empirical Distributions. The Annals of Mathematical Statistics 19(2), 279 \u2013 281 (1948). https:\/\/doi.org\/10.1214\/aoms\/1177730256,https:\/\/doi.org\/10.1214\/aoms\/1177730256","DOI":"10.1214\/aoms\/1177730256"},{"key":"23_CR70","unstructured":"Steffen, B., Howar, F., Isberner, M.: Active Automata Learning: From DFAs to Interface Programs and Beyond. In: Heinz, J., de\u00a0la Higuera, C., Oates, T. (eds.) Proceedings of the Eleventh International Conference on Grammatical Inference, ICGI 2012, University of Maryland, College Park, USA, September 5-8, 2012. JMLR Proceedings, vol.\u00a021, pp. 195\u2013209. JMLR.org (2012), http:\/\/proceedings.mlr.press\/v21\/steffen12a.html"},{"key":"23_CR71","doi-asserted-by":"publisher","unstructured":"Steffen, B., Howar, F., Merten, M.: Introduction to Active Automata Learning from a Practical Perspective, pp. 256\u2013296. Springer Berlin Heidelberg, Berlin, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21455-4_8, https:\/\/doi.org\/10.1007\/978-3-642-21455-4_8","DOI":"10.1007\/978-3-642-21455-4_8"},{"key":"23_CR72","unstructured":"Stoelinga, M.: An Introduction to Probabilistic Automata. Bull. EATCS 78, 176\u2013198 (2002)"},{"key":"23_CR73","unstructured":"Suilen, M., Sim\u00e3o, T.D., Parker, D., Jansen, N.: Robust anytime learning of Markov decision processes. In: Proceedings of the 36th International Conference on Neural Information Processing Systems. NIPS \u201922, Curran Associates Inc., Red Hook, NY, USA (2024)"},{"key":"23_CR74","doi-asserted-by":"publisher","unstructured":"Tappler, M., Aichernig, B.K., Bacci, G., Eichlseder, M., Larsen, K.G.: $$L^*$$-based learning of Markov decision processes (extended version). Formal Aspects Comput. , 575\u2013615 (2021). https:\/\/doi.org\/10.1007\/s00165-021-00536-5","DOI":"10.1007\/s00165-021-00536-5"},{"key":"23_CR75","doi-asserted-by":"publisher","unstructured":"Telek, M., Horv\u00e1th, G.: A minimal representation of markov arrival processes and a moments matching method. Perform. Evaluation 64(9\u201312), 1153\u20131168 (2007). https:\/\/doi.org\/10.1016\/j.peva.2007.06.001","DOI":"10.1016\/j.peva.2007.06.001"},{"key":"23_CR76","doi-asserted-by":"publisher","unstructured":"Teng, Y., Zhang, M., An, J.: Learning Deterministic Multi-Clock Timed Automata. In: \u00c1brah\u00e1m, E., Jr., M.M. (eds.) Proceedings of the 27th ACM International Conference on Hybrid Systems: Computation and Control, HSCC 2024, Hong Kong SAR, China, May 14-16, 2024. pp. 6:1\u20136:11. ACM (2024). https:\/\/doi.org\/10.1145\/3641513.3650124, https:\/\/doi.org\/10.1145\/3641513.3650124","DOI":"10.1145\/3641513.3650124"},{"key":"23_CR77","doi-asserted-by":"publisher","unstructured":"Th\u00fcmmler, A., Buchholz, P., Telek, M.: A novel approach for phase-type fitting with the EM algorithm. IEEE Trans. Dependable Secur. Comput. 3(3), 245\u2013258 (2006). https:\/\/doi.org\/10.1109\/TDSC.2006.27","DOI":"10.1109\/TDSC.2006.27"},{"key":"23_CR78","doi-asserted-by":"crossref","unstructured":"Vaandrager, F., Garhewal, B., Rot, J., Wi\u00dfmann, T.: A New Approach for Active Automata Learning Based on Apartness. In: Fisman, D., Rosu, G. (eds.) Tools and Algorithms for the Construction and Analysis of Systems. pp. 223\u2013243. Springer International Publishing, Cham (2022)","DOI":"10.1007\/978-3-030-99524-9_12"},{"key":"23_CR79","doi-asserted-by":"publisher","unstructured":"Vaandrager, F., Melse, I.: New Fault Domains for Conformance Testing of Finite State Machines. In: Bouyer, P., van\u00a0de Pol, J. (eds.) 36th International Conference on Concurrency Theory (CONCUR 2025). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0348, pp. 34:1\u201334:22. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2025). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2025.34, https:\/\/drops.dagstuhl.de\/entities\/document\/10.4230\/LIPIcs.CONCUR.2025.34","DOI":"10.4230\/LIPIcs.CONCUR.2025.34"},{"key":"23_CR80","doi-asserted-by":"publisher","unstructured":"Vasilevskii, M.P.: Failure diagnosis of automata. Cybernetics 9(4), 653\u2013665 (Jul 1973). https:\/\/doi.org\/10.1007\/BF01068590, https:\/\/doi.org\/10.1007\/BF01068590","DOI":"10.1007\/BF01068590"},{"key":"23_CR81","doi-asserted-by":"publisher","unstructured":"Verwer, S., de\u00a0Weerdt, 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, https:\/\/doi.org\/10.1007\/s10994-011-5265-4","DOI":"10.1007\/S10994-011-5265-4"},{"key":"23_CR82","doi-asserted-by":"publisher","unstructured":"Waga, M.: Falsification of cyber-physical systems with robustness-guided black-box checking. In: Ames, A.D., Seshia, S.A., Deshmukh, J. (eds.) HSCC \u201920: 23rd ACM International Conference on Hybrid Systems: Computation and Control, Sydney, New South Wales, Australia, April 21-24, 2020. pp. 11:1\u201311:13. ACM (2020). https:\/\/doi.org\/10.1145\/3365365.3382193, https:\/\/doi.org\/10.1145\/3365365.3382193","DOI":"10.1145\/3365365.3382193"},{"key":"23_CR83","doi-asserted-by":"crossref","unstructured":"Waga, M.: Active Learning of Deterministic Timed Automata with Myhill-Nerode Style Characterization. In: Enea, C., Lal, A. (eds.) Computer Aided Verification. pp. 3\u201326. Springer Nature Switzerland, Cham (2023)","DOI":"10.1007\/978-3-031-37706-8_1"}],"container-title":["Lecture Notes in Computer Science","Integrated Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-10794-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T13:59:43Z","timestamp":1767967183000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-10794-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,16]]},"ISBN":["9783032107930","9783032107947"],"references-count":83,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-10794-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,16]]},"assertion":[{"value":"16 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The full version of this paper (including all proofs and experiments) can be found at [\n                      \n                      ].","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Full version"}},{"value":"IFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integrated Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ifm2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ifm2025.ens.psl.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}