{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:02:54Z","timestamp":1750309374285,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":68,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T00:00:00Z","timestamp":1720396800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["101077902"],"award-info":[{"award-number":["101077902"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["389792660 TRR 248?CPEC"],"award-info":[{"award-number":["389792660 TRR 248?CPEC"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,8]]},"DOI":"10.1145\/3661814.3662133","type":"proceedings-article","created":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T12:30:12Z","timestamp":1718973012000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Verifying Unboundedness via Amalgamation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9462-8514","authenticated-orcid":false,"given":"Ashwani","family":"Anand","sequence":"first","affiliation":[{"name":"Rigorous Software Engineering, Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4101-4308","authenticated-orcid":false,"given":"Sylvain","family":"Schmitz","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Paris, CNRS, IRIF, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4002-5491","authenticated-orcid":false,"given":"Lia","family":"Sch\u00fctze","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6421-4388","authenticated-orcid":false,"given":"Georg","family":"Zetzsche","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern, Germany"}]}],"member":"320","published-online":{"date-parts":[[2024,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1999.2843"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Ashwani Anand Sylvain Schmitz Lia Sch\u00fctze and Georg Zetzsche. 2024. Verifying Unboundedness via Amalgamation. arXiv:2405.10296 [cs.FL]","DOI":"10.1145\/3661814.3662133"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CONCUR.2023.39"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.FSTTCS.2011.152"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.MFCS.2017.49"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-15579-1_37"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.3233\/FI-222145"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2022.112"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-30829-1_12"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","unstructured":"Jean Berstel. 1979. Transductions and Context-Free Languages. Teubner. 10.1007\/978-3-663-09367-1","DOI":"10.1007\/978-3-663-09367-1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40313-2_22"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054112400709"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0003"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.TCS.2016.04.020"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.STACS.2017.24"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2934527"},{"key":"e_1_3_2_1_18_1","first-page":"178","article-title":"On constructing obstruction sets of words","volume":"44","author":"Courcelle Bruno","year":"1991","unstructured":"Bruno Courcelle. 1991. On constructing obstruction sets of words. Bull. EATCS 44 (1991), 178--186.","journal-title":"Bull. EATCS"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.23638\/LMCS-15(2:20)2019"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.23638\/DMTCS-19-4-1"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3373718.3394776"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2018.119"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0055044"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21500-6_18"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00282-1"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-18088-5_43"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.FSTTCS.2023.42"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00102-X"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3531130.3533345"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.226.13"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054110007441"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00236-007-0050-3"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.2307\/1994067"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2016.97"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-10(4:4)2014"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14162-1_39"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIME.2001.930718"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00236-007-0055-Y"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2837614.2837627"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22110-1_60"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(69)80111-0"},{"volume-title":"Semilinearity of the reachability set is decidable for Petri nets. Ph. D. Dissertation","author":"Hauschildt Dirk","key":"e_1_3_2_1_42_1","unstructured":"Dirk Hauschildt. 1990. Semilinearity of the reachability set is decidable for Petri nets. Ph. D. Dissertation. University of Hamburg, Germany. https:\/\/d-nb.info\/911413707"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01178731"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-2.1.326"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-16078-7_74"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802201"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(72)90063-5"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90173-D"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.29007\/BNX2"},{"key":"e_1_3_2_1_50_1","unstructured":"J\u00e9r\u00f4me Leroux. 2019. Personal communication."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.16"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.23638\/LMCS-15(4:15)2019"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47666-6_26"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802477"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00646-1"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/321356.321364"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.FSTTCS.2017.45"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40313-2_64"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(78)90036-1"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2008.12.042"},{"key":"e_1_3_2_1_62_1","unstructured":"Sylvain Schmitz and Philippe Schnoebelen. 2012. Algorithmic Aspects of WQO Theory. Lecture notes. http:\/\/cel.archives-ouvertes.fr\/cel-00727025"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-30806-3_15"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(78)90156-5"},{"key":"e_1_3_2_1_65_1","first-page":"562","article-title":"A circle-of-lights algorithm for the \"money-changing problem","volume":"85","author":"Wilf Herbert S","year":"1978","unstructured":"Herbert S Wilf. 1978. A circle-of-lights algorithm for the \"money-changing problem\". Amer. Math. Monthly 85, 7 (1978), 562--565.","journal-title":"Amer. Math. Monthly"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47666-6_35"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.STACS.2015.743"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209108.3209201"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2020.104583"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-89716-1_4"}],"event":{"name":"LICS '24: 39th Annual ACM\/IEEE Symposium on Logic in Computer Science","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","IEEE Computer Society","EACSL"],"location":"Tallinn Estonia","acronym":"LICS '24"},"container-title":["Proceedings of the 39th Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3661814.3662133","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3661814.3662133","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:06:21Z","timestamp":1750291581000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3661814.3662133"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,8]]},"references-count":68,"alternative-id":["10.1145\/3661814.3662133","10.1145\/3661814"],"URL":"https:\/\/doi.org\/10.1145\/3661814.3662133","relation":{},"subject":[],"published":{"date-parts":[[2024,7,8]]},"assertion":[{"value":"2024-07-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}