{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T16:02:42Z","timestamp":1781193762353,"version":"3.54.1"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032280787","type":"print"},{"value":"9783032280794","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-28079-4_8","type":"book-chapter","created":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T15:34:10Z","timestamp":1781192050000},"page":"170-191","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning Probabilistic Automata from\u00a0Single Continuous-Valued System Logs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9730-9335","authenticated-orcid":false,"given":"Simon","family":"Dierl","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-5005-9645","authenticated-orcid":false,"given":"Nastaran","family":"Kianersi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9524-4459","authenticated-orcid":false,"given":"Falk","family":"Howar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6341-3898","authenticated-orcid":false,"given":"Sean","family":"Kauffman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,12]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/11872436_24","volume-title":"Grammatical Inference: Algorithms and Applications","author":"P Adriaans","year":"2006","unstructured":"Adriaans, P., Jacobs, C.: Using MDL for grammar induction. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS (LNAI), vol. 4201, pp. 293\u2013306. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11872436_24"},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"Aminikhanghahi, S., Cook, D.J.: A survey of methods for time series change point detection. Knowl. Inf. Syst. 51(2), 339\u2013367 (2017). https:\/\/doi.org\/10.1007\/s10115-016-0987-z","DOI":"10.1007\/s10115-016-0987-z"},{"issue":"6","key":"8_CR3","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1109\/TSE.2003.1205180","volume":"29","author":"C Baier","year":"2003","unstructured":"Baier, C., Haverkort, B., Hermanns, H., Katoen, J.P.: Model-checking algorithms for continuous-time Markov chains. IEEE Trans. Software Eng. 29(6), 524\u2013541 (2003). https:\/\/doi.org\/10.1109\/TSE.2003.1205180","journal-title":"IEEE Trans. Software Eng."},{"key":"8_CR4","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":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-58473-0_144","volume-title":"Grammatical Inference and Applications","author":"RC Carrasco","year":"1994","unstructured":"Carrasco, R.C., Oncina, J.: Learning stochastic regular grammars by means of a state merging method. In: Carrasco, R.C., Oncina, J. (eds.) ICGI 1994. LNCS, vol. 862, pp. 139\u2013152. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58473-0_144"},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Celisse, A., Marot, G., Pierre-Jean, M., Rigaill, G.: New efficient algorithms for multiple change-point detection with reproducing kernels. Comput. Stat. Data Anal. 128, 200\u2013220 (2018). https:\/\/doi.org\/10.1016\/j.csda.2018.07.002","DOI":"10.1016\/j.csda.2018.07.002"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1111\/j.2517-6161.1964.tb00544.x","volume":"26","author":"DR Cox","year":"1964","unstructured":"Cox, D.R.: Some applications of exponential ordered scores. J. Roy. Stat. Soc.: Ser. B (Methodol.) 26(1), 103\u2013110 (1964). https:\/\/doi.org\/10.1111\/j.2517-6161.1964.tb00544.x","journal-title":"J. Roy. Stat. Soc.: Ser. B (Methodol.)"},{"key":"8_CR8","doi-asserted-by":"publisher","unstructured":"Demessance, T., Bi, C., Djebali, S., Gu\u00e9rard, G.: Hidden Markov model to predict tourists visited places. In: 2021 22nd IEEE International Conference on Mobile Data Management (MDM), pp. 209\u2013216. IEEE (2021).https:\/\/doi.org\/10.1109\/MDM52706.2021.00041","DOI":"10.1109\/MDM52706.2021.00041"},{"key":"8_CR9","doi-asserted-by":"publisher","unstructured":"Dierl, S., et al: Learning symbolic timed models from concrete timed data. In: Rozier, K.Y., Chaudhuri, S. (eds.) NASA Formal Methods. Lecture Notes in Computer Science, vol. 13903, pp. 104\u2013121. Springer Nature Switzerland, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-33170-1_7","DOI":"10.1007\/978-3-031-33170-1_7"},{"key":"8_CR10","doi-asserted-by":"publisher","unstructured":"Frohme, M., Howar, F., Steffen, B.: LearnLib: 10 years later. In: Piskac, R., Rakamari\u0107, Z. (eds.) Computer Aided Verification. Lecture Notes in Computer Science, vol. 15934, pp. 141\u2013160. Springer Nature Switzerland, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-98685-7_7","DOI":"10.1007\/978-3-031-98685-7_7"},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"Garc\u00eda, J., Vis\u00fas, A., Fern\u00e1ndez, F.: A taxonomy for similarity metrics between markov decision processes. Mach. Learn. 111(11), 4217\u20134247 (2022). https:\/\/doi.org\/10.1007\/s10994-022-06242-4","DOI":"10.1007\/s10994-022-06242-4"},{"issue":"9","key":"8_CR12","doi-asserted-by":"publisher","first-page":"1332","DOI":"10.1016\/j.patcog.2005.01.003","volume":"38","author":"C de la Higuera","year":"2005","unstructured":"de la Higuera, C.: A bibliographical study of grammatical inference. Pattern Recogn. 38(9), 1332\u20131348 (2005). https:\/\/doi.org\/10.1016\/j.patcog.2005.01.003","journal-title":"Pattern Recogn."},{"issue":"4","key":"8_CR13","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1214\/aoms\/1177730150","volume":"19","author":"W Hoeffding","year":"1948","unstructured":"Hoeffding, W.: A non-parametric test of independence. Ann. Math. Stat. 19(4), 546\u2013557 (1948). https:\/\/doi.org\/10.1214\/aoms\/1177730150","journal-title":"Ann. Math. Stat."},{"key":"8_CR14","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-319-96562-8_5"},{"key":"8_CR15","doi-asserted-by":"publisher","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN\u201995 - International Conference on Neural Networks, pp. 1942\u20131948. (1995). https:\/\/doi.org\/10.1109\/ICNN.1995.488968","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"500","key":"8_CR16","doi-asserted-by":"publisher","first-page":"1590","DOI":"10.1080\/01621459.2012.737745","volume":"107","author":"R Killick","year":"2012","unstructured":"Killick, R., Fearnhead, P., Eckley, I.A.: Optimal detection of changepoints with a linear computational cost. J. Am. Stat. Assoc. 107(500), 1590\u20131598 (2012). https:\/\/doi.org\/10.1080\/01621459.2012.737745","journal-title":"J. Am. Stat. Assoc."},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0054059","volume-title":"Grammatical Inference","author":"KJ Lang","year":"1998","unstructured":"Lang, K.J., Pearlmutter, B.A., Price, R.A.: Results of the abbadingo one DFA learning competition and a new evidence-driven state merging algorithm. In: Honavar, V., Slutzki, G. (eds.) ICGI 1998. LNCS, vol. 1433, pp. 1\u201312. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054059"},{"issue":"2","key":"8_CR18","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"SP Lloyd","year":"1982","unstructured":"Lloyd, S.P.: Least squares quantization in PCM. IEEE Trans. Inf. Theory 28(2), 129\u2013137 (1982). https:\/\/doi.org\/10.1109\/TIT.1982.1056489","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"8_CR19","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10994-016-5565-9","volume":"105","author":"H Mao","year":"2016","unstructured":"Mao, H., Chen, Y., Jaeger, M., Nielsen, T.D., Larsen, K.G., Nielsen, B.: Learning deterministic probabilistic automata from a model checking perspective. Mach. Learn. 105(2), 255\u2013299 (2016). https:\/\/doi.org\/10.1007\/s10994-016-5565-9","journal-title":"Mach. Learn."},{"key":"8_CR20","doi-asserted-by":"publisher","unstructured":"Nguyen, L.V., Johnson, T.T.: Benchmark: DC-to-DC switched-mode power converters (buck converters, boost converters, and buck-boost converters). In: Frehse, G., Althoff, M. (eds.) ARCH14-15. 1st and 2nd International Workshop on Applied veRification for Continuous and Hybrid Systems. EPiC Series in Computing, vol.\u00a034, pp. 19\u201324. EasyChair (2015). https:\/\/doi.org\/10.29007\/23pm","DOI":"10.29007\/23pm"},{"issue":"6","key":"8_CR21","doi-asserted-by":"publisher","first-page":"4421","DOI":"10.1109\/TPWRS.2020.2986019","volume":"35","author":"S Pandey","year":"2020","unstructured":"Pandey, S., Srivastava, A.K., Amidan, B.G.: A real time event detection, classification and localization using synchrophasor data. IEEE Trans. Power Syst. 35(6), 4421\u20134431 (2020). https:\/\/doi.org\/10.1109\/TPWRS.2020.2986019","journal-title":"IEEE Trans. Power Syst."},{"key":"8_CR22","doi-asserted-by":"publisher","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. arXiv preprint arXiv:1201.0490, arXiv (2018).https:\/\/doi.org\/10.48550\/arXiv.1201.0490","DOI":"10.48550\/arXiv.1201.0490"},{"key":"8_CR23","unstructured":"Perkins, T.J.: Maximum likelihood trajectories for continuous-time markov chains. In: Bengio, Y., Schuurmans, D., Lafferty, J., Williams, C., Culotta, A. (eds.) Advances in Neural Information Processing Systems, pp. 1437\u20131445. Curran Associates, Inc. (2009). https:\/\/proceedings.neurips.cc\/paper\/2009\/hash\/afda332245e2af431fb7b672a68b659d-Abstract.html"},{"key":"8_CR24","doi-asserted-by":"publisher","unstructured":"Jordehi, R, A., Jasni, J.: Particle swarm optimisation for discrete optimisation problems: a review. Artif. Intell. Rev. 43, 243\u2013258 (2014). https:\/\/doi.org\/10.1007\/s10462-012-9373-8","DOI":"10.1007\/s10462-012-9373-8"},{"key":"8_CR25","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","volume":"20","author":"PJ Rousseeuw","year":"1987","unstructured":"Rousseeuw, P.J.: Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. J. Comput. Appl. Math. 20, 53\u201365 (1987). https:\/\/doi.org\/10.1016\/0377-0427(87)90125-7","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"8_CR26","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/3556543","volume":"22","author":"I Saberi","year":"2022","unstructured":"Saberi, I., Faghih, F., Bavil, F.S.: A passive online technique for learning hybrid automata from input\/output traces. ACM Trans. Embed. Comput. Syst. 22(1), 9 (2022). https:\/\/doi.org\/10.1145\/3556543","journal-title":"ACM Trans. Embed. Comput. Syst."},{"key":"8_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2019.107299","volume":"167","author":"C Truong","year":"2020","unstructured":"Truong, C., Oudre, L., Vayatis, N.: Selective review of offline change point detection methods. Signal Process. 167, 107299 (2020). https:\/\/doi.org\/10.1016\/j.sigpro.2019.107299","journal-title":"Signal Process."},{"key":"8_CR28","doi-asserted-by":"publisher","unstructured":"Vaz, R., et al.: Event detection and classification through wavelet-based method in low voltage wide-area monitoring systems. Int. J. Electr. Power Energy Syst. 130, 106919 (2021). https:\/\/doi.org\/10.1016\/j.ijepes.2021.106919","DOI":"10.1016\/j.ijepes.2021.106919"},{"issue":"2","key":"8_CR29","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/TIT.1967.1054010","volume":"13","author":"AJ Viterbi","year":"1967","unstructured":"Viterbi, A.J.: Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Trans. Inf. Theory 13(2), 260\u2013269 (1967). https:\/\/doi.org\/10.1109\/TIT.1967.1054010","journal-title":"IEEE Trans. Inf. Theory"},{"key":"8_CR30","doi-asserted-by":"publisher","unstructured":"Wang, F., Cao, Z., Tan, L., Zong, H.: Survey on learning-based formal methods: taxonomy, applications and possible future directions. IEEE Access 8, 108561\u2013108578 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.3000907","DOI":"10.1109\/ACCESS.2020.3000907"},{"key":"8_CR31","doi-asserted-by":"publisher","unstructured":"Xu, G., Yu, G.: On convergence analysis of particle swarm optimization algorithm. J. Comput. Appl. Math. 333, 65\u201373 (2018). https:\/\/doi.org\/10.1016\/j.cam.2017.10.026","DOI":"10.1016\/j.cam.2017.10.026"},{"issue":"2","key":"8_CR32","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/3470455","volume":"6","author":"X Yang","year":"2022","unstructured":"Yang, X., Beg, O.A., Kenigsberg, M., Johnson, T.T.: A framework for identification and validation of affine hybrid automata from input-output traces. ACM Trans. Cyber. Phys. Syst. 6(2), 13 (2022). https:\/\/doi.org\/10.1145\/3470455","journal-title":"ACM Trans. Cyber. Phys. Syst."},{"issue":"13","key":"8_CR33","doi-asserted-by":"publisher","first-page":"2980","DOI":"10.3390\/math11132980","volume":"11","author":"JP van Zyl","year":"2023","unstructured":"van Zyl, J.P., Engelbrecht, A.P.: Set-based particle swarm optimisation: a review. Mathematics 11(13), 2980 (2023). https:\/\/doi.org\/10.3390\/math11132980","journal-title":"Mathematics"}],"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-032-28079-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T15:34:12Z","timestamp":1781192052000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-28079-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032280787","9783032280794"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-28079-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"12 June 2026","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":"Los Angeles, CA","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfm2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/nfm2026.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}