{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:23:07Z","timestamp":1776316987940,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T00:00:00Z","timestamp":1659398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NCN","award":["2019\/35\/B\/ST6\/02322."],"award-info":[{"award-number":["2019\/35\/B\/ST6\/02322."]}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["950398"],"award-info":[{"award-number":["950398"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,2]]},"DOI":"10.1145\/3531130.3533333","type":"proceedings-article","created":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T20:23:38Z","timestamp":1659644618000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Solvability of orbit-finite systems of linear equations"],"prefix":"10.1145","author":[{"given":"Arka","family":"Ghosh","sequence":"first","affiliation":[{"name":"University of Warsaw, Poland"}]},{"given":"Piotr","family":"Hofman","sequence":"additional","affiliation":[{"name":"University of Warsaw, Poland"}]},{"given":"Slawomir","family":"Lasota","sequence":"additional","affiliation":[{"name":"University of Warsaw, Poland"}]}],"member":"320","published-online":{"date-parts":[[2022,8,4]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Miko\u0142aj Boja\u0144czyk. 2019. Slightly Infinite Sets. (2019). https:\/\/www.mimuw.edu.pl\/~bojan\/paper\/atom-book  Miko\u0142aj Boja\u0144czyk. 2019. Slightly Infinite Sets. (2019). https:\/\/www.mimuw.edu.pl\/~bojan\/paper\/atom-book"},{"key":"e_1_3_2_1_2_1","volume-title":"Automata theory in nominal sets. Log. Methods Comput. Sci. 10, 3","author":"Boja\u0144czyk Miko\u0142aj","year":"2014","unstructured":"Miko\u0142aj Boja\u0144czyk , Bartek Klin , and Slawomir Lasota . 2014. Automata theory in nominal sets. Log. Methods Comput. Sci. 10, 3 ( 2014 ). Miko\u0142aj Boja\u0144czyk, Bartek Klin, and Slawomir Lasota. 2014. Automata theory in nominal sets. Log. Methods Comput. Sci. 10, 3 (2014)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS52264.2021.9470634"},{"key":"e_1_3_2_1_4_1","volume-title":"Proc.\u00a0FSTTCS","author":"Boja\u0144czyk Miko\u0142aj","year":"2012","unstructured":"Miko\u0142aj Boja\u0144czyk and Szymon Toru\u0144czyk . 2012 . Imperative Programming in Sets with Atoms . In Proc.\u00a0FSTTCS 2012, Vol.\u00a018. 4\u201315. Miko\u0142aj Boja\u0144czyk and Szymon Toru\u0144czyk. 2012. Imperative Programming in Sets with Atoms. In Proc.\u00a0FSTTCS 2012, Vol.\u00a018. 4\u201315."},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. CSL\u201915","author":"Clemente L.","unstructured":"L. Clemente and S. Lasota . 2015. Reachability analysis of first-order definable pushdown systems . In Proc. CSL\u201915 . 244\u2013259. L. Clemente and S. Lasota. 2015. Reachability analysis of first-order definable pushdown systems. In Proc. CSL\u201915. 244\u2013259."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-19225-3_1"},{"key":"e_1_3_2_1_7_1","volume-title":"Introduction to Algorithms","author":"Cormen H.","unstructured":"Thomas\u00a0 H. Cormen , Charles\u00a0 E. Leiserson , Ronald\u00a0 L. Rivest , and Clifford Stein . 2009. Introduction to Algorithms , 3 rd Edition. MIT Press . Thomas\u00a0H. Cormen, Charles\u00a0E. Leiserson, Ronald\u00a0L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms, 3rd Edition. MIT Press.","edition":"3"},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. FOCS 2021","author":"Wojciech","year":"2021","unstructured":"Wojciech Czerwi\u0144ski and \u0141ukasz Orlikowski. 2021. Reachability in Vector Addition Systems is Ackermann-complete . In Proc. FOCS 2021 . IEEE, 1229\u20131240. https:\/\/doi.org\/10.1109\/FOCS52979. 2021 .00120 10.1109\/FOCS52979.2021.00120 Wojciech Czerwi\u0144ski and \u0141ukasz Orlikowski. 2021. Reachability in Vector Addition Systems is Ackermann-complete. In Proc. FOCS 2021. IEEE, 1229\u20131240. https:\/\/doi.org\/10.1109\/FOCS52979.2021.00120"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90242-9"},{"key":"e_1_3_2_1_10_1","volume-title":"Solvability of orbit-finite systems of linear equations. arXiv CoRR abs\/2201.09060","author":"Ghosh Arka","year":"2022","unstructured":"Arka Ghosh , Piotr Hofman , and Slawomir Lasota . 2022. Solvability of orbit-finite systems of linear equations. arXiv CoRR abs\/2201.09060 ( 2022 ). arXiv:2201.09060https:\/\/arxiv.org\/abs\/2201.09060 Arka Ghosh, Piotr Hofman, and Slawomir Lasota. 2022. Solvability of orbit-finite systems of linear equations. arXiv CoRR abs\/2201.09060 (2022). arXiv:2201.09060https:\/\/arxiv.org\/abs\/2201.09060"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17127-8_15"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS52264.2021.9470626"},{"key":"e_1_3_2_1_13_1","volume-title":"Proc.\u00a0 CONCUR","author":"Hofman Piotr","year":"2018","unstructured":"Piotr Hofman and Slawomir Lasota . 2018 . Linear Equations with Ordered Data . In Proc.\u00a0 CONCUR 2018. 24:1\u201324:17. Piotr Hofman and Slawomir Lasota. 2018. Linear Equations with Ordered Data. In Proc.\u00a0 CONCUR 2018. 24:1\u201324:17."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49630-5_26"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2017.8005065"},{"key":"e_1_3_2_1_16_1","volume-title":"Linear equations for unordered data vectors. arXiv CoRR abs\/2109.03025","author":"Hofman Piotr","year":"2021","unstructured":"Piotr Hofman and Jakub R\u00f3zycki . 2021. Linear equations for unordered data vectors. arXiv CoRR abs\/2109.03025 ( 2021 ). arXiv:2109.03025https:\/\/arxiv.org\/abs\/2109.03025 Piotr Hofman and Jakub R\u00f3zycki. 2021. Linear equations for unordered data vectors. arXiv CoRR abs\/2109.03025 (2021). arXiv:2109.03025https:\/\/arxiv.org\/abs\/2109.03025"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.51"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802201"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90173-D"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-39086-4_3"},{"key":"e_1_3_2_1_21_1","volume-title":"Proc.\u00a0STACS 2022(LIPIcs, Vol.\u00a0219)","author":"Lasota S\u0142awomir","year":"2022","unstructured":"S\u0142awomir Lasota . 2022 . Improved Ackermannian lower bound for the Petri nets reachability problem . In Proc.\u00a0STACS 2022(LIPIcs, Vol.\u00a0219) . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 46:1\u201346:15. https:\/\/doi.org\/10.4230\/LIPIcs.STACS. 2022.46 10.4230\/LIPIcs.STACS.2022.46 S\u0142awomir Lasota. 2022. Improved Ackermannian lower bound for the Petri nets reachability problem. In Proc.\u00a0STACS 2022(LIPIcs, Vol.\u00a0219). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 46:1\u201346:15. https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2022.46"},{"key":"e_1_3_2_1_22_1","first-page":"251","article-title":"Nets with Tokens which Carry Data","volume":"88","author":"Lazic Ranko","year":"2008","unstructured":"Ranko Lazic , Thomas\u00a0Christopher Newcomb , Jo\u00ebl Ouaknine , A.\u00a0 W. Roscoe , and James Worrell . 2008 . Nets with Tokens which Carry Data . Fundam. Inform. 88 , 3 (2008), 251 \u2013 274 . Ranko Lazic, Thomas\u00a0Christopher Newcomb, Jo\u00ebl Ouaknine, A.\u00a0W. Roscoe, and James Worrell. 2008. Nets with Tokens which Carry Data. Fundam. Inform. 88, 3 (2008), 251\u2013274.","journal-title":"Fundam. Inform."},{"key":"e_1_3_2_1_23_1","volume-title":"Concurrency, Security, and Puzzles - Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday. 144\u2013161.","author":"Lazic Ranko","unstructured":"Ranko Lazic and Patrick Totzke . 2017. What Makes Petri Nets Harder to Verify: Stack or Data? . In Concurrency, Security, and Puzzles - Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday. 144\u2013161. Ranko Lazic and Patrick Totzke. 2017. What Makes Petri Nets Harder to Verify: Stack or Data?. In Concurrency, Security, and Puzzles - Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday. 144\u2013161."},{"key":"e_1_3_2_1_24_1","volume-title":"Proc. FOCS 2021","author":"Leroux J\u00e9r\u00f4me","year":"2021","unstructured":"J\u00e9r\u00f4me Leroux . 2021 . The Reachability Problem for Petri Nets is Not Primitive Recursive . In Proc. FOCS 2021 . IEEE, 1241\u20131252. https:\/\/doi.org\/10.1109\/FOCS52979.2021.00121 To appear. 10.1109\/FOCS52979.2021.00121 J\u00e9r\u00f4me Leroux. 2021. The Reachability Problem for Petri Nets is Not Primitive Recursive. In Proc. FOCS 2021. IEEE, 1241\u20131252. https:\/\/doi.org\/10.1109\/FOCS52979.2021.00121 To appear."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.16"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802477"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1013560.1013562"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/2512979"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Manuel\u00a0Silva Su\u00e1rez Enrique Teruel and Jos\u00e9\u00a0Manuel Colom. 1996. Linear Algebraic and Linear Programming Techniques for the Analysis of Place or Transition Net Systems. In Lectures on Petri Nets I: Basic Models Advances in Petri Nets. 309\u2013373.  Manuel\u00a0Silva Su\u00e1rez Enrique Teruel and Jos\u00e9\u00a0Manuel Colom. 1996. Linear Algebraic and Linear Programming Techniques for the Analysis of Place or Transition Net Systems. In Lectures on Petri Nets I: Basic Models Advances in Petri Nets. 309\u2013373.","DOI":"10.1007\/3-540-65306-6_19"}],"event":{"name":"LICS '22: 37th Annual ACM\/IEEE Symposium on Logic in Computer Science","location":"Haifa Israel","acronym":"LICS '22","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation"]},"container-title":["Proceedings of the 37th Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531130.3533333","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3531130.3533333","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:09Z","timestamp":1750186929000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531130.3533333"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,2]]},"references-count":29,"alternative-id":["10.1145\/3531130.3533333","10.1145\/3531130"],"URL":"https:\/\/doi.org\/10.1145\/3531130.3533333","relation":{},"subject":[],"published":{"date-parts":[[2022,8,2]]},"assertion":[{"value":"2022-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}