{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:54:34Z","timestamp":1742968474664,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030913830"},{"type":"electronic","value":"9783030913847"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-91384-7_10","type":"book-chapter","created":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T13:03:12Z","timestamp":1638450192000},"page":"186-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Taxonomy and Reductions for Common Register Automata Formalisms"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9730-9335","authenticated-orcid":false,"given":"Simon","family":"Dierl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9524-4459","authenticated-orcid":false,"given":"Falk","family":"Howar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-319-46750-4_21","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2016","author":"P Babari","year":"2016","unstructured":"Babari, P., Droste, M., Perevoshchikov, V.: Weighted register automata and weighted logic on data words. In: Sampaio, A., Wang, F. (eds.) ICTAC 2016. LNCS, vol. 9965, pp. 370\u2013384. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46750-4_21"},{"key":"10_CR2","unstructured":"Benedikt, M., Ley, C., Puppis, G.: What you must remember when processing data words. In: Laender, A.H.F., Lakshmanan, L.V.S. (eds.) Proceedings of the 4th Alberto Mendelzon International Workshop on Foundations of Data Management. CEUR Workshop Proceedings, vol. 619, pp. 11.1\u201311.8. CEUR-WS.org, Aachen (2010). http:\/\/ceur-ws.org\/Vol-619\/paper11.pdf"},{"issue":"4","key":"10_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-10(3:4)2014","volume":"10","author":"M Boja\u0144czyk","year":"2014","unstructured":"Boja\u0144czyk, M., Klin, B., Lasota, S.: Automata theory in nominal sets. Log. Methods Comput. Sci. 10(4), 1\u201344 (2014). https:\/\/doi.org\/10.2168\/LMCS-10(3:4)2014","journal-title":"Log. Methods Comput. Sci."},{"key":"10_CR4","unstructured":"Cassel, S., Howar, F., Jonsson, B.: RALib: a LearnLib extension for inferring EFSMs. In: Proceedings of the 4th International Workshop on Design and Implementation of Formal Tools and Systems (2015). https:\/\/www.faculty.ece.vt.edu\/chaowang\/difts2015\/papers\/paper_5.pdf"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-642-24372-1_26","volume-title":"Automated Technology for Verification and Analysis","author":"S Cassel","year":"2011","unstructured":"Cassel, S., Howar, F., Jonsson, B., Merten, M., Steffen, B.: A succinct canonical register automaton model. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol. 6996, pp. 366\u2013380. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24372-1_26"},{"issue":"1","key":"10_CR6","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.jlamp.2014.07.004","volume":"84","author":"S Cassel","year":"2015","unstructured":"Cassel, S., Howar, F., Jonsson, B., Merten, M., Steffen, B.: A succinct canonical register automaton model. J. Log. Algebr. Methods Program. 84(1), 54\u201366 (2015). https:\/\/doi.org\/10.1016\/j.jlamp.2014.07.004","journal-title":"J. Log. Algebr. Methods Program."},{"issue":"2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00165-016-0355-5","volume":"28","author":"S Cassel","year":"2016","unstructured":"Cassel, S., Howar, F., Jonsson, B., Steffen, B.: Active learning for extended finite state machines. Formal Aspects Comput. 28(2), 233\u2013263 (2016). https:\/\/doi.org\/10.1007\/s00165-016-0355-5","journal-title":"Formal Aspects Comput."},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Chen, Y.F., Leng\u00e1l, O., Tan, T., Wu, Z.: Register automata with linear arithmetic. In: 2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), pp. 1\u201312. IEEE, June 2017. https:\/\/doi.org\/10.1109\/LICS.2017.8005111","DOI":"10.1109\/LICS.2017.8005111"},{"issue":"3","key":"10_CR9","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s002360050120","volume":"35","author":"EYC Cheng","year":"1998","unstructured":"Cheng, E.Y.C., Kaminski, M.: Context-free languages over infinite alphabets. Acta Inform. 35(3), 245\u2013267 (1998). https:\/\/doi.org\/10.1007\/s002360050120","journal-title":"Acta Inform."},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-25540-4_1","volume-title":"Computer Aided Verification","author":"L D\u2019Antoni","year":"2019","unstructured":"D\u2019Antoni, L., Ferreira, T., Sammartino, M., Silva, A.: Symbolic register automata. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11561, pp. 3\u201321. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25540-4_1"},{"issue":"3","key":"10_CR11","doi-asserted-by":"publisher","first-page":"16:1","DOI":"10.1145\/1507244.1507246","volume":"10","author":"S Demri","year":"2009","unstructured":"Demri, S., Lazi\u0107, R.: LTL with the freeze quantifier and register automata. ACM Trans. Comput. Log. 10(3), 16:1-16:30 (2009). https:\/\/doi.org\/10.1145\/1507244.1507246","journal-title":"ACM Trans. Comput. Log."},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Howar, F.: Active learning of interface programs. Ph.D. thesis, Technische Universit\u00e4t Dortmund, June 2012. https:\/\/doi.org\/10.17877\/DE290R-4817","DOI":"10.17877\/DE290R-4817"},{"issue":"2","key":"10_CR13","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10994-013-5419-7","volume":"96","author":"M Isberner","year":"2013","unstructured":"Isberner, M., Howar, F., Steffen, B.: Learning register automata: from languages to program structures. Mach. Learn. 96(2), 65\u201398 (2013). https:\/\/doi.org\/10.1007\/s10994-013-5419-7","journal-title":"Mach. Learn."},{"key":"10_CR14","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"},{"issue":"2","key":"10_CR15","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"134","author":"M Kaminski","year":"1994","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. Theor. Comput. Sci. 134(2), 329\u2013363 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)90242-9","journal-title":"Theor. Comput. Sci."},{"issue":"05","key":"10_CR16","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1142\/S0129054110007532","volume":"21","author":"M Kaminski","year":"2010","unstructured":"Kaminski, M., Zeitlin, D.: Finite-memory automata with non-deterministic reassignment. Int. J. Found. Comput. Sci. 21(05), 741\u2013760 (2010). https:\/\/doi.org\/10.1142\/S0129054110007532","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-662-44522-8_39","volume-title":"Mathematical Foundations of Computer Science 2014","author":"AS Murawski","year":"2014","unstructured":"Murawski, A.S., Ramsay, S.J., Tzevelekos, N.: Reachability in pushdown register automata. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014. LNCS, vol. 8634, pp. 464\u2013473. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44522-8_39"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jcss.2017.02.008","volume":"87","author":"AS Murawski","year":"2017","unstructured":"Murawski, A.S., Ramsay, S.J., Tzevelekos, N.: Reachability in pushdown register automata. J. Comput. Syst. Sci 87, 58\u201383 (2017). https:\/\/doi.org\/10.1016\/j.jcss.2017.02.008","journal-title":"J. Comput. Syst. Sci"},{"issue":"3","key":"10_CR19","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/1013560.1013562","volume":"5","author":"F Neven","year":"2004","unstructured":"Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Logic 5(3), 403\u2013435 (2004). https:\/\/doi.org\/10.1145\/1013560.1013562","journal-title":"ACM Trans. Comput. Logic"},{"issue":"5","key":"10_CR20","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1090\/S0002-9904-1944-08111-1","volume":"50","author":"EL Post","year":"1944","unstructured":"Post, E.L.: Recursively enumerable sets of positive integers and their decision problems. Bull. Am. Math. Soc. 50(5), 284\u2013316 (1944). https:\/\/doi.org\/10.1090\/S0002-9904-1944-08111-1","journal-title":"Bull. Am. Math. Soc."},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"Saint-Andre, P.: Extensible messaging and presence protocol (XMPP): Core. RFC 6120, RFC Editor, March 2011. https:\/\/doi.org\/10.17487\/RFC6120","DOI":"10.17487\/RFC6120"},{"issue":"2","key":"10_CR22","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0304-3975(99)00105-X","volume":"231","author":"H Sakamoto","year":"2000","unstructured":"Sakamoto, H., Ikeda, D.: Intractability of decision problems for finite-memory automata. Theor. Comput. Sci. 231(2), 297\u2013308 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(99)00105-X","journal-title":"Theor. Comput. Sci."},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11874683_3","volume-title":"Computer Science Logic","author":"L Segoufin","year":"2006","unstructured":"Segoufin, L.: Automata and logics for words and trees over an infinite alphabet. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 41\u201357. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11874683_3"},{"key":"10_CR24","doi-asserted-by":"publisher","unstructured":"Tzevelekos, N.: Fresh-register automata. In: Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 295\u2013306. ACM, New York (2011). https:\/\/doi.org\/10.1145\/1926385.1926420","DOI":"10.1145\/1926385.1926420"}],"container-title":["Lecture Notes in Computer Science","Model Checking, Synthesis, and Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91384-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T13:04:01Z","timestamp":1638450241000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91384-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030913830","9783030913847"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91384-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}