{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:10Z","timestamp":1759639090334,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030025076"},{"type":"electronic","value":"9783030025083"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-02508-3_26","type":"book-chapter","created":{"date-parts":[[2018,10,13]],"date-time":"2018-10-13T18:22:47Z","timestamp":1539454967000},"page":"493-512","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast Computations on Ordered Nominal Sets"],"prefix":"10.1007","author":[{"given":"David","family":"Venhoek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joshua","family":"Moerman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jurriaan","family":"Rot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,15]]},"reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-319-25150-9_11","volume-title":"Theoretical Aspects of Computing - ICTAC 2015","author":"F Aarts","year":"2015","unstructured":"Aarts, F., Fiterau-Brostean, P., Kuppens, H., Vaandrager, F.: Learning register automata with fresh value generation. In: Leucker, M., Rueda, C., Valencia, F.D. (eds.) ICTAC 2015. LNCS, vol. 9399, pp. 165\u2013183. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25150-9_11"},{"issue":"2","key":"26_CR2","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":"26_CR3","doi-asserted-by":"publisher","unstructured":"Boja\u0144czyk, M., Braud, L., Klin, B., Lasota, S.: Towards nominal computation. In: Proceedings of 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2012, Philadelphia, PA, USA, pp. 401\u2013412. ACM Press, New York (2012). https:\/\/doi.org\/10.1145\/2103656.2103704","DOI":"10.1145\/2103656.2103704"},{"key":"26_CR4","doi-asserted-by":"publisher","unstructured":"Boja\u0144czyk, M., Klin, B., Lasota, S.: Automata theory in nominal sets. Log. Methods Comput. Sci. 10(3), Article no. 4 (2014). https:\/\/doi.org\/10.2168\/lmcs-10(3:4)2014","DOI":"10.2168\/lmcs-10(3:4)2014"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-31585-5_12","volume-title":"Automata, Languages, and Programming","author":"M Boja\u0144czyk","year":"2012","unstructured":"Boja\u0144czyk, M., Lasota, S.: A machine-independent characterization of timed languages. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7392, pp. 92\u2013103. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31585-5_12"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-642-38771-5_12","volume-title":"Developments in Language Theory","author":"B Bollig","year":"2013","unstructured":"Bollig, B., Habermehl, P., Leucker, M., Monmege, B.: A fresh approach to learning register automata. In: B\u00e9al, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 118\u2013130. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38771-5_12"},{"issue":"2","key":"26_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 Asp. Comput. 28(2), 233\u2013263 (2016). https:\/\/doi.org\/10.1007\/s00165-016-0355-5","journal-title":"Formal Asp. Comput."},{"issue":"2","key":"26_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.entcs.2010.07.014","volume":"264","author":"V Ciancia","year":"2010","unstructured":"Ciancia, V., Kurz, A., Montanari, U.: Families of symmetries as efficient models of resource binding. Electron. Notes Theor. Comput. Sci. 264(2), 63\u201381 (2010). https:\/\/doi.org\/10.1016\/j.entcs.2010.07.014","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"12","key":"26_CR9","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1016\/j.ic.2009.10.007","volume":"208","author":"V Ciancia","year":"2010","unstructured":"Ciancia, V., Montanari, U.: Symmetries, local names and dynamic (de)-allocation of names. Inf. Comput. 208(12), 1349\u20131367 (2010). https:\/\/doi.org\/10.1016\/j.ic.2009.10.007","journal-title":"Inf. Comput."},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-319-63387-9_3","volume-title":"Computer Aided Verification","author":"L D\u2019Antoni","year":"2017","unstructured":"D\u2019Antoni, L., Veanes, M.: The power of symbolic automata and transducers. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10426, pp. 47\u201367. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63387-9_3"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-662-54577-5_10","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Drews","year":"2017","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). https:\/\/doi.org\/10.1007\/978-3-662-54577-5_10"},{"issue":"2\u20133","key":"26_CR12","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.tcs.2004.09.021","volume":"331","author":"GL Ferrari","year":"2005","unstructured":"Ferrari, G.L., Montanari, U., Tuosto, E.: Coalgebraic minimization of HD-automata for the $$\\pi $$ \u03c0 -calculus using polymorphic types. Theor. Comput. Sci. 331(2\u20133), 325\u2013365 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2004.09.021","journal-title":"Theor. Comput. Sci."},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-319-41540-6_25","volume-title":"Computer Aided Verification","author":"P Fiter\u0103u-Bro\u015ftean","year":"2016","unstructured":"Fiter\u0103u-Bro\u015ftean, P., Janssen, R., Vaandrager, F.: Combining model learning and model checking to analyze TCP implementations. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9780, pp. 454\u2013471. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41540-6_25"},{"issue":"3\u20135","key":"26_CR14","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s001650200016","volume":"13","author":"M Gabbay","year":"2002","unstructured":"Gabbay, M., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Asp. Comput. 13(3\u20135), 341\u2013363 (2002). https:\/\/doi.org\/10.1007\/s001650200016","journal-title":"Formal Asp. Comput."},{"key":"26_CR15","doi-asserted-by":"publisher","unstructured":"Grigore, R., Tzevelekos, N.: History-register automata. Log. Methods Comput. Sci. 12(1), Article no. 7 (2016). https:\/\/doi.org\/10.2168\/lmcs-12(1:7)2016","DOI":"10.2168\/lmcs-12(1:7)2016"},{"issue":"2","key":"26_CR16","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."},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"57","DOI":"10.4204\/EPTCS.207.3","volume":"207","author":"Bartek Klin","year":"2016","unstructured":"Klin, B., Szynwelski, M.: SMT solving for functional programming over infinite structures. In: Atkey, R., Krishnaswami, N.R. (eds.) Proc. of 6th Workshop on Mathematically Structured Functional Programming, MSFP 2016 (Eindhoven, Apr. 2016). Electronic Proceedings in Theoretical Computer Science, vol. 207, pp. 57\u201375. Open Publishing Association, Sydney (2016). https:\/\/doi.org\/10.4204\/eptcs.207.3","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"26_CR18","unstructured":"Kopczynski, E., Toru\u0144czyk, S.: LOIS: an application of SMT solvers. In: King, T., Piskac, R. (eds.) Proceedings of 14th International Workshop on Satisfiability Modulo Theories, SMT 2016, Coimbra, July 2016. CEUR Workshop Proceedings, vol. 1617, pp. 51\u201360. CEUR-WS.org (2016). http:\/\/ceur-ws.org\/Vol-1617\/paper5.pdf"},{"key":"26_CR19","doi-asserted-by":"publisher","unstructured":"Kopczynski, E., Toru\u0144czyk, S.: LOIS: syntax and semantics. In: Proceedings of 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, January 2017, pp. 586\u2013598. ACM Press, New York (2017). https:\/\/doi.org\/10.1145\/3009837.3009876","DOI":"10.1145\/3009837.3009876"},{"key":"26_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-319-63121-9_8","volume-title":"Models, Algorithms, Logics and Tools","author":"O Maler","year":"2017","unstructured":"Maler, O., Mens, I.-E.: A generic algorithm for learning symbolic automata from membership queries. In: Aceto, L., Bacci, G., Bacci, G., Ing\u00f3lfsd\u00f3ttir, A., Legay, A., Mardare, R. (eds.) Models, Algorithms, Logics and Tools. LNCS, vol. 10460, pp. 146\u2013169. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63121-9_8"},{"key":"26_CR21","doi-asserted-by":"publisher","unstructured":"Moerman, J., Sammartino, M., Silva, A., Klin, B., Szynwelski, M.: Learning nominal automata. In: Proceedings of 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, January 2017, pp. 613\u2013625. ACM Press, New York (2017). https:\/\/doi.org\/10.1145\/3009837.3009879","DOI":"10.1145\/3009837.3009879"},{"key":"26_CR22","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/s1571-0661(05)80696-6","volume":"10","author":"U Montanari","year":"1998","unstructured":"Montanari, U., Pistore, M.: An introduction to history dependent automata. Electron. Notes Theor. Comput. Sci. 10, 170\u2013188 (1998). https:\/\/doi.org\/10.1016\/s1571-0661(05)80696-6","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"26_CR23","doi-asserted-by":"publisher","unstructured":"Murawski, A.S., Ramsay, S.J., Tzevelekos, N.: Bisimilarity in fresh-register automata. In: Proceedings of 30th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, July 2015, pp. 156\u2013167. IEEE CS Press (2015). https:\/\/doi.org\/10.1109\/lics.2015.24","DOI":"10.1109\/lics.2015.24"},{"key":"26_CR24","doi-asserted-by":"publisher","unstructured":"Pitts, A.M.: Nominal Sets: Names and Symmetry in Computer Science. Cambridge Tracts in Theoretical Computer Science, vol. 57. Cambridge University Press, Cambridge (2013). https:\/\/doi.org\/10.1017\/cbo9781139084673","DOI":"10.1017\/cbo9781139084673"},{"issue":"1","key":"26_CR25","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/2893582.2893594","volume":"3","author":"AM Pitts","year":"2016","unstructured":"Pitts, A.M.: Nominal techniques. SIGLOG News 3(1), 57\u201372 (2016). http:\/\/doi.acm.org\/10.1145\/2893582.2893594","journal-title":"SIGLOG News"},{"key":"26_CR26","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":"26_CR27","unstructured":"Shinwell, M.R., Pitts, A.M.: Fresh Objective Caml user manual. Technical report, Computer Laboratory, University of Cambridge (2005)"},{"key":"26_CR28","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/11532231_4","volume-title":"Automated Deduction \u2013 CADE-20","author":"C Urban","year":"2005","unstructured":"Urban, C., Tasson, C.: Nominal techniques in Isabelle\/HOL. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 38\u201353. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11532231_4"},{"issue":"2","key":"26_CR29","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/2967606","volume":"60","author":"FW Vaandrager","year":"2017","unstructured":"Vaandrager, F.W.: Model learning. Commun. ACM 60(2), 86\u201395 (2017). https:\/\/doi.org\/10.1145\/2967606","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2018"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-02508-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,13]],"date-time":"2020-11-13T01:12:20Z","timestamp":1605229940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-02508-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030025076","9783030025083"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-02508-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"15 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Stellenbosch","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"South Africa","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2018","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":"ictac2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ictac.org.za\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}