{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:09:30Z","timestamp":1742987370408,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031212123"},{"type":"electronic","value":"9783031212130"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-21213-0_12","type":"book-chapter","created":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T06:08:19Z","timestamp":1670652499000},"page":"187-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On-The-Fly Bisimilarity Checking for\u00a0Fresh-Register Automata"],"prefix":"10.1007","author":[{"given":"M. H.","family":"Bandukara","sequence":"first","affiliation":[]},{"given":"N.","family":"Tzevelekos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,11]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Aarts, F., Fiterau-Brostean, P., Kuppens, H., Vaandrager, F.: Learning register automata with fresh value generation. In: ICTAC Proceedings, pp. 165\u2013183 (2015)","DOI":"10.1007\/978-3-319-25150-9_11"},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2740","volume":"148","author":"M Abadi","year":"1999","unstructured":"Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols: the SPI calculus. Inf. Comput. 148(1), 1\u201370 (1999)","journal-title":"Inf. Comput."},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Aceto, L., Ing\u00f3lfsd\u00f3ttir, A., Srba, J.: The algorithmics of bisimilarity. In: Advanced Topics in Bisimulation and Coinduction, pp. 100\u2013172. CUP (2012)","DOI":"10.1017\/CBO9780511792588.004"},{"issue":"9","key":"12_CR4","doi-asserted-by":"publisher","first-page":"1729","DOI":"10.1080\/00927878608823393","volume":"14","author":"L Babai","year":"1986","unstructured":"Babai, L.: On the length of subgroup chains in the symmetric group. Comm. Algebra 14(9), 1729\u20131736 (1986)","journal-title":"Comm. Algebra"},{"issue":"3","key":"12_CR5","first-page":"1","volume":"10","author":"M Bojanczyk","year":"2014","unstructured":"Bojanczyk, M., Klin, B., Lasota, S.: Automata theory in nominal sets. LMCS 10(3), 1\u201314 (2014)","journal-title":"LMCS"},{"issue":"4","key":"12_CR6","first-page":"1","volume":"10","author":"B Bollig","year":"2014","unstructured":"Bollig, B., Habermehl, P., Leucker, M., Monmege, B.: A robust class of data languages and an application to learning. LMCS 10(4), 1\u20139 (2014)","journal-title":"LMCS"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-55179-4_18","volume-title":"Computer Aided Verification","author":"J-C Fernandez","year":"1992","unstructured":"Fernandez, J.-C., Mounier, L.: \u201cOn the fly\u2019\u2019 verification of behavioural equivalences and preorders. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol. 575, pp. 181\u2013191. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55179-4_18"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Ferrari, G.L., Montanari, U., Raggi, R., Tuosto, E.: From co-algebraic specifications to implementation: The Mihda toolkit. In: FMCO Revised Lectures (2002)","DOI":"10.1007\/978-3-540-39656-7_13"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Grigore, R., Distefano, D., Petersen, R.L., Tzevelekos, N.: Runtime verification based on register automata. In: TACAS Proceedings, pp. 260\u2013276 (2013)","DOI":"10.1007\/978-3-642-36742-7_19"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Grumberg, O., Kupferman, O., Sheinvald, S.: Variable automata over infinite alphabets. In: LATA Proceedings, pp. 561\u2013572 (2010)","DOI":"10.1007\/978-3-642-13089-2_47"},{"issue":"2","key":"12_CR11","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. Theoret. Comput. Sci. 134(2), 329\u2013363 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Klin, B., Szynwelski, M.: SMT solving for functional programming over infinite structures. In: MSFP Proceedings, vol. 207, pp. 57\u201375 (2016)","DOI":"10.4204\/EPTCS.207.3"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01375471","volume":"11","author":"DE Knuth","year":"1991","unstructured":"Knuth, D.E.: Efficient representation of perm groups. Combinatorica 11, 33\u201343 (1991)","journal-title":"Combinatorica"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Kopczynski, E., Torunczyk, S.: LOIS: syntax and semantics. In: POPL Proceedings, pp. 586\u2013598. ACM (2017)","DOI":"10.1145\/3093333.3009876"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02951922","volume":"15","author":"H Lin","year":"2008","unstructured":"Lin, H.: Computing bisimulations for finite-control $$\\pi $$-calculus. J. Comput. Sci. Technol. 15, 1\u20139 (2008)","journal-title":"J. Comput. Sci. Technol."},{"issue":"1","key":"12_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes I and II. Inf. Comput. 100(1), 1\u201340 (1992)","journal-title":"Inf. Comput."},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Moerman, J., Sammartino, M., Silva, A., Klin, B., Szynwelski, M.: Learning nominal automata. In: POPL Proceedings, pp. 613\u2013625. ACM (2017)","DOI":"10.1145\/3093333.3009879"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Montanari, U., Pistore, M.: pi-calculus, structured coalgebras, and minimal HD-automata. In: Nielsen, M., Rovan, B. (eds.) MFCS Proceedings, pp. 569\u2013578 (2000)","DOI":"10.1007\/3-540-44612-5_52"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Murawski, A.S., Ramsay, S.J., Tzevelekos, N.: DEQ: equivalence checker for deterministic register automata. In: ATVA Proceedings, pp. 350\u2013356 (2019)","DOI":"10.1007\/978-3-030-31784-3_20"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Murawski, A., Ramsay, S., Tzevelekos, N.: A contextual equivalence checker for IMJ*. In: ATVA Proceedings, pp. 234\u2013240 (2015)","DOI":"10.1007\/978-3-319-24953-7_19"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Murawski, A.S., Ramsay, S.J., Tzevelekos, N.: Bisimilarity in fresh-register automata. In: LICS Proceedings, pp. 156\u2013167 (2015)","DOI":"10.1109\/LICS.2015.24"},{"key":"12_CR22","unstructured":"Murawski, A.S., Ramsay, S.J., Tzevelekos, N.: Polynomial-time equivalence testing for deterministic fresh-register automata. In: MFCS Proceedings (2018)"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Murawski, A.S., Tzevelekos, N.: Algorithmic nominal game semantics. In: ESOP Proceedings, pp. 419\u2013438 (2011)","DOI":"10.1007\/978-3-642-19718-5_22"},{"issue":"3","key":"12_CR24","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10703-017-0292-9","volume":"52","author":"AS Murawski","year":"2018","unstructured":"Murawski, A.S., Tzevelekos, N.: Algorithmic games for full ground references. Formal Methods Syst. Des. 52(3), 277\u2013314 (2018)","journal-title":"Formal Methods Syst. Des."},{"issue":"3","key":"12_CR25","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)","journal-title":"ACM Trans. Comput. Logic"},{"issue":"1","key":"12_CR26","first-page":"1","volume":"17","author":"J Parrow","year":"2021","unstructured":"Parrow, J., Borgstr\u00f6m, J., Eriksson, L., Gutkovas, R., Weber, T.: Modal logics for nominal transition systems. Log. Methods Comput. Sci. 17(1), 1\u201314 (2021)","journal-title":"Log. Methods Comput. Sci."},{"key":"12_CR27","unstructured":"Pistore, M.: History-Dependent Automata. Ph.D. thesis, Universit\u00e0 di Pisa (1999)"},{"issue":"2","key":"12_CR28","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)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR29","unstructured":"Sangiorgi, D., Walker, D.: The Pi-Calculus - a theory of mobile processes. Cambridge University Press, Cambridge (2001)"},{"issue":"3","key":"12_CR30","first-page":"289","volume":"73","author":"T Schwentick","year":"2007","unstructured":"Schwentick, T.: Automata for XML-a survey. JCSS 73(3), 289\u2013315 (2007)","journal-title":"JCSS"},{"key":"12_CR31","unstructured":"Sloane, N.J.A.: The On-Line Encyclopedia of Integer Sequences. https:\/\/oeis.org\/A002720. Sep 2022"},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"Tzevelekos, N.: Fresh-register automata. In: POPL Proceedings. ACM (2011)","DOI":"10.1145\/1926385.1926420"}],"container-title":["Lecture Notes in Computer Science","Dependable Software Engineering. Theories, Tools, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21213-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T06:16:04Z","timestamp":1670652964000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21213-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031212123","9783031212130"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21213-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"11 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SETTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Dependable Software Engineering: Theories, Tools, and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"setta2022","order":10,"name":"conference_id","label":"Conference ID","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":"29","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":"11","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":"3","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":"38% - 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":"4","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":"3","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)"}}]}}