{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T10:18:43Z","timestamp":1770286723114,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":49,"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:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["389792660"],"award-info":[{"award-number":["389792660"]}],"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":[[2022,8,2]]},"DOI":"10.1145\/3531130.3533345","type":"proceedings-article","created":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T20:23:38Z","timestamp":1659644618000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["The Complexity of Bidirected Reachability in Valence Systems"],"prefix":"10.1145","author":[{"given":"Moses","family":"Ganardi","sequence":"first","affiliation":[{"name":"Max Planck Institute for Software Systems (MPI-SWS), Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rupak","family":"Majumdar","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Software Systems (MPI-SWS), Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georg","family":"Zetzsche","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Software Systems (MPI-SWS), Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,8,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s000370050023"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00001603"},{"key":"e_1_3_2_1_3_1","first-page":"1","article-title":"The Nielsen reduction and P-complete problems in free groups","volume":"32","author":"Avenhaus J\u00fcrgen","year":"1984","unstructured":"J\u00fcrgen Avenhaus and Klaus Madlener . 1984 . The Nielsen reduction and P-complete problems in free groups . Theoretical Computer Science 32 , 1 - 2 (1984), 61\u201376. J\u00fcrgen Avenhaus and Klaus Madlener. 1984. The Nielsen reduction and P-complete problems in free groups. Theoretical Computer Science 32, 1-2 (1984), 61\u201376.","journal-title":"Theoretical Computer Science"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1112\/S0024609397003305"},{"key":"e_1_3_2_1_5_1","volume-title":"MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings(Lecture Notes in Computer Science, Vol.\u00a06907)","author":"Bonnet R\u00e9mi","year":"2011","unstructured":"R\u00e9mi Bonnet . 2011 . The Reachability Problem for Vector Addition System with One Zero-Test. In Mathematical Foundations of Computer Science 2011 - 36th International Symposium , MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings(Lecture Notes in Computer Science, Vol.\u00a06907) , Filip Murlak and Piotr Sankowski (Eds.). Springer, 145\u2013157. https:\/\/doi.org\/10.1007\/978-3-642-22993-0_16 10.1007\/978-3-642-22993-0_16 R\u00e9mi Bonnet. 2011. The Reachability Problem for Vector Addition System with One Zero-Test. In Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings(Lecture Notes in Computer Science, Vol.\u00a06907), Filip Murlak and Piotr Sankowski (Eds.). Springer, 145\u2013157. https:\/\/doi.org\/10.1007\/978-3-642-22993-0_16"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40313-2_22"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158118"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Swarat Chaudhuri. 2008. Subcubic algorithms for recursive state machines. In POPL \u201908. ACM 159\u2013169.  Swarat Chaudhuri. 2008. Subcubic algorithms for recursive state machines. In POPL \u201908. ACM 159\u2013169.","DOI":"10.1145\/1328897.1328460"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/0211057"},{"key":"e_1_3_2_1_10_1","volume-title":"62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021","author":"Wojciech","year":"2022","unstructured":"Wojciech Czerwi\u0144ski and \u0141ukasz Orlikowski. 2021. Reachability in Vector Addition Systems is Ackermann-complete . In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021 , Denver, CO, USA , February 7-10, 2022 . 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 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022. IEEE, 1229\u20131240. https:\/\/doi.org\/10.1109\/FOCS52979.2021.00120"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196706003372"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2934552"},{"key":"e_1_3_2_1_13_1","volume-title":"Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. In 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012","author":"Elberfeld Michael","year":"2012","unstructured":"Michael Elberfeld , Andreas Jakoby , and Till Tantau . 2012 . Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. In 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012 , February 29 th - March 3rd , 2012, Paris, France(LIPIcs, Vol.\u00a014), Christoph D\u00fcrr and Thomas Wilke (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 66\u201377. https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2012.66 10.4230\/LIPIcs.STACS.2012.66 Michael Elberfeld, Andreas Jakoby, and Till Tantau. 2012. Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. In 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France(LIPIcs, Vol.\u00a014), Christoph D\u00fcrr and Thomas Wilke (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 66\u201377. https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2012.66"},{"key":"#cr-split#-e_1_3_2_1_14_1.1","unstructured":"Moses Ganardi Rupak Majumdar and Georg Zetzsche. 2021. The complexity of bidirected reachability in valence systems. (2021). https:\/\/doi.org\/10.48550\/arXiv.2110.03654 arXiv:2110.03654 10.48550\/arXiv.2110.03654"},{"key":"#cr-split#-e_1_3_2_1_14_1.2","doi-asserted-by":"crossref","unstructured":"Moses Ganardi Rupak Majumdar and Georg Zetzsche. 2021. The complexity of bidirected reachability in valence systems. (2021). https:\/\/doi.org\/10.48550\/arXiv.2110.03654 arXiv:2110.03654","DOI":"10.1145\/3531130.3533345"},{"key":"e_1_3_2_1_15_1","volume-title":"RP 2014, Oxford, UK, September 22-24, 2014. Proceedings(Lecture Notes in Computer Science, Vol.\u00a08762)","author":"Haase Christoph","year":"2014","unstructured":"Christoph Haase and Simon Halfon . 2014 . Integer Vector Addition Systems with States. In Reachability Problems - 8th International Workshop , RP 2014, Oxford, UK, September 22-24, 2014. Proceedings(Lecture Notes in Computer Science, Vol.\u00a08762) , Jo\u00ebl Ouaknine, Igor Potapov, and James Worrell (Eds.). Springer, 112\u2013124. https:\/\/doi.org\/10.1007\/978-3-319-11439-2_9 10.1007\/978-3-319-11439-2_9 Christoph Haase and Simon Halfon. 2014. Integer Vector Addition Systems with States. In Reachability Problems - 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014. Proceedings(Lecture Notes in Computer Science, Vol.\u00a08762), Jo\u00ebl Ouaknine, Igor Potapov, and James Worrell (Eds.). Springer, 112\u2013124. https:\/\/doi.org\/10.1007\/978-3-319-11439-2_9"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2019.8785850"},{"key":"e_1_3_2_1_17_1","volume-title":"CAV 2011, Snowbird, UT, USA, July 14-20, 2011. Proceedings(Lecture Notes in Computer Science, Vol.\u00a06806)","author":"Hague Matthew","year":"2011","unstructured":"Matthew Hague and Anthony\u00a0Widjaja Lin . 2011 . Model Checking Recursive Programs with Numeric Data Types. In Computer Aided Verification - 23rd International Conference , CAV 2011, Snowbird, UT, USA, July 14-20, 2011. Proceedings(Lecture Notes in Computer Science, Vol.\u00a06806) , Ganesh Gopalakrishnan and Shaz Qadeer (Eds.). Springer, 743\u2013759. https:\/\/doi.org\/10.1007\/978-3-642-22110-1_60 10.1007\/978-3-642-22110-1_60 Matthew Hague and Anthony\u00a0Widjaja Lin. 2011. Model Checking Recursive Programs with Numeric Data Types. In Computer Aided Verification - 23rd International Conference, CAV 2011, Snowbird, UT, USA, July 14-20, 2011. Proceedings(Lecture Notes in Computer Science, Vol.\u00a06806), Ganesh Gopalakrishnan and Shaz Qadeer (Eds.). Springer, 743\u2013759. https:\/\/doi.org\/10.1007\/978-3-642-22110-1_60"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1142\/S021819670500213X"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3498673"},{"key":"e_1_3_2_1_20_1","volume-title":"11th International Symposium, FCT \u201997, Krak\u00f3w, Poland, September 1-3, 1997, Proceedings(Lecture Notes in Computer Science, Vol.\u00a01279)","author":"Koppenhagen Ulla","year":"1997","unstructured":"Ulla Koppenhagen and Ernst\u00a0 W. Mayr . 1997 . The Complexity of the Coverability, the Containment, and the Equivalence Problems for Commutative Semigroups. In Fundamentals of Computation Theory , 11th International Symposium, FCT \u201997, Krak\u00f3w, Poland, September 1-3, 1997, Proceedings(Lecture Notes in Computer Science, Vol.\u00a01279) , Bogdan\u00a0S. Chlebus and Ludwik Czaja (Eds.). Springer, 257\u2013268. https:\/\/doi.org\/10.1007\/BFb0036189 10.1007\/BFb0036189 Ulla Koppenhagen and Ernst\u00a0W. Mayr. 1997. The Complexity of the Coverability, the Containment, and the Equivalence Problems for Commutative Semigroups. In Fundamentals of Computation Theory, 11th International Symposium, FCT \u201997, Krak\u00f3w, Poland, September 1-3, 1997, Proceedings(Lecture Notes in Computer Science, Vol.\u00a01279), Bogdan\u00a0S. Chlebus and Ludwik Czaja (Eds.). Springer, 257\u2013268. https:\/\/doi.org\/10.1007\/BFb0036189"},{"key":"e_1_3_2_1_21_1","volume-title":"Serge Lang. 2005. Algebra (revised","unstructured":"Serge Lang. 2005. Algebra (revised third edition ed.). Springer-Verlag . Serge Lang. 2005. Algebra (revised third edition ed.). Springer-Verlag."},{"key":"e_1_3_2_1_22_1","volume-title":"62nd IEEE Annual Symposium on Foundations of Computer Science, 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 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021 , Denver, CO, USA , February 7-10, 2022. IEEE, 1241\u20131252. https:\/\/doi.org\/10.1109\/FOCS52979.2021.00121 10.1109\/FOCS52979.2021.00121 J\u00e9r\u00f4me Leroux. 2021. The Reachability Problem for Petri Nets is Not Primitive Recursive. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022. IEEE, 1241\u20131252. https:\/\/doi.org\/10.1109\/FOCS52979.2021.00121"},{"key":"e_1_3_2_1_23_1","volume-title":"42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II(Lecture Notes in Computer Science, Vol.\u00a09135)","author":"Leroux J\u00e9r\u00f4me","year":"2015","unstructured":"J\u00e9r\u00f4me Leroux , Gr\u00e9goire Sutre , and Patrick Totzke . 2015 . On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension. In Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II(Lecture Notes in Computer Science, Vol.\u00a09135) , Magn\u00fas\u00a0M. Halld\u00f3rsson, Kazuo Iwama, Naoki Kobayashi, and Bettina Speckmann (Eds.). Springer, 324\u2013336. https:\/\/doi.org\/10.1007\/978-3-662-47666-6_26 10.1007\/978-3-662-47666-6_26 J\u00e9r\u00f4me Leroux, Gr\u00e9goire Sutre, and Patrick Totzke. 2015. On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension. In Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II(Lecture Notes in Computer Science, Vol.\u00a09135), Magn\u00fas\u00a0M. Halld\u00f3rsson, Kazuo Iwama, Naoki Kobayashi, and Bettina Speckmann (Eds.). Springer, 324\u2013336. https:\/\/doi.org\/10.1007\/978-3-662-47666-6_26"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3386021"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3434340"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Markus Lohrey. 2013. The rational subset membership problem for groups: a survey. In Groups St Andrews Vol.\u00a0422. 368\u2013389.  Markus Lohrey. 2013. The rational subset membership problem for groups: a survey. In Groups St Andrews Vol.\u00a0422. 368\u2013389.","DOI":"10.1017\/CBO9781316227343.024"},{"key":"e_1_3_2_1_27_1","volume-title":"When is a graph product of groups virtually-free?Communications in Algebra\u00ae 35, 2","author":"Lohrey Markus","year":"2007","unstructured":"Markus Lohrey and G\u00e9raud S\u00e9nizergues . 2007. When is a graph product of groups virtually-free?Communications in Algebra\u00ae 35, 2 ( 2007 ), 617\u2013621. Markus Lohrey and G\u00e9raud S\u00e9nizergues. 2007. When is a graph product of groups virtually-free?Communications in Algebra\u00ae 35, 2 (2007), 617\u2013621."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgebra.2007.08.025"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-09-10126-0"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-017-9808-3"},{"key":"e_1_3_2_1_31_1","volume-title":"Combinatorial Group Theory","author":"Lyndon C","unstructured":"Roger\u00a0 C Lyndon and Paul\u00a0 E Schupp . 1977. Combinatorial Group Theory . Springer-Verlag . Roger\u00a0C Lyndon and Paul\u00a0E Schupp. 1977. Combinatorial Group Theory. Springer-Verlag."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/0001-8708(82)90048-2"},{"key":"e_1_3_2_1_33_1","volume-title":"Proc. of the 29th International Conference on Concurrency Theory (CONCUR 2018)","author":"Meyer Roland","year":"2018","unstructured":"Roland Meyer , Sebastian Muskalla , and Georg Zetzsche . 2018 . Bounded Context Switching for Valence Systems . In Proc. of the 29th International Conference on Concurrency Theory (CONCUR 2018) (LIPIcs, Vol.\u00a0118). Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, 12:1\u201312:18. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR. 2018.12 10.4230\/LIPIcs.CONCUR.2018.12 Roland Meyer, Sebastian Muskalla, and Georg Zetzsche. 2018. Bounded Context Switching for Valence Systems. In Proc. of the 29th International Conference on Concurrency Theory (CONCUR 2018)(LIPIcs, Vol.\u00a0118). Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, 12:1\u201312:18. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2018.12"},{"key":"e_1_3_2_1_34_1","volume-title":"The occurrence problem for direct products of groups. Matematicheskii Sbornik (Novaya Seriya) 70(112)","author":"Mikhailova A.","year":"1966","unstructured":"K.\u00a0 A. Mikhailova . 1966. The occurrence problem for direct products of groups. Matematicheskii Sbornik (Novaya Seriya) 70(112) ( 1966 ), 241\u2013251. Issue 2. K.\u00a0A. Mikhailova. 1966. The occurrence problem for direct products of groups. Matematicheskii Sbornik (Novaya Seriya) 70(112) (1966), 241\u2013251. Issue 2."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391289.1391291"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2008.12.042"},{"key":"e_1_3_2_1_37_1","volume-title":"Proc. of the 32nd International Conference on Concurrency Theory (CONCUR 2021)","author":"Shetty Aneesh","year":"2021","unstructured":"Aneesh Shetty , Krishna S., and Georg Zetzsche . 2021 . Scope-Bounded Reachability in Valence Systems . In Proc. of the 32nd International Conference on Concurrency Theory (CONCUR 2021) (LIPIcs, Vol.\u00a0118). Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR. 2021.29 10.4230\/LIPIcs.CONCUR.2021.29 Aneesh Shetty, Krishna S., and Georg Zetzsche. 2021. Scope-Bounded Reachability in Valence Systems. In Proc. of the 32nd International Conference on Concurrency Theory (CONCUR 2021)(LIPIcs, Vol.\u00a0118). Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2021.29"},{"key":"e_1_3_2_1_38_1","volume-title":"20th International Conference on Automated Deduction, Tallinn, Estonia, July 22-27, 2005, Proceedings(Lecture Notes in Computer Science, Vol.\u00a03632)","author":"Verma Kumar\u00a0Neeraj","year":"2005","unstructured":"Kumar\u00a0Neeraj Verma , Helmut Seidl , and Thomas Schwentick . 2005 . On the Complexity of Equational Horn Clauses. In Automated Deduction - CADE-20 , 20th International Conference on Automated Deduction, Tallinn, Estonia, July 22-27, 2005, Proceedings(Lecture Notes in Computer Science, Vol.\u00a03632) , Robert Nieuwenhuis (Ed.). Springer, 337\u2013352. https:\/\/doi.org\/10.1007\/11532231_25 10.1007\/11532231_25 Kumar\u00a0Neeraj Verma, Helmut Seidl, and Thomas Schwentick. 2005. On the Complexity of Equational Horn Clauses. In Automated Deduction - CADE-20, 20th International Conference on Automated Deduction, Tallinn, Estonia, July 22-27, 2005, Proceedings(Lecture Notes in Computer Science, Vol.\u00a03632), Robert Nieuwenhuis (Ed.). Springer, 337\u2013352. https:\/\/doi.org\/10.1007\/11532231_25"},{"key":"e_1_3_2_1_39_1","volume-title":"From Riches to RAAGs: 3-maniforld, right-angled Artin groups, and cubical geometry","author":"Wise D.","unstructured":"D. Wise . 2012. From Riches to RAAGs: 3-maniforld, right-angled Artin groups, and cubical geometry . American Mathematical Society . D. Wise. 2012. From Riches to RAAGs: 3-maniforld, right-angled Artin groups, and cubical geometry. American Mathematical Society."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03013-0_6"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001420.2001440"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39212-2_39"},{"key":"e_1_3_2_1_43_1","volume-title":"Proc. of the 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)(Leibniz International Proceedings in Informatics (LIPIcs), Vol.\u00a030)","author":"Zetzsche Georg","year":"2015","unstructured":"Georg Zetzsche . 2015 . Computing downward closures for stacked counter automata . In Proc. of the 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)(Leibniz International Proceedings in Informatics (LIPIcs), Vol.\u00a030) , Ernst\u00a0W. Mayr and Nicolas Ollinger (Eds.). Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 743\u2013756. https:\/\/doi.org\/10.4230\/LIPIcs.STACS. 2015.743 10.4230\/LIPIcs.STACS.2015.743 Georg Zetzsche. 2015. Computing downward closures for stacked counter automata. In Proc. of the 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)(Leibniz International Proceedings in Informatics (LIPIcs), Vol.\u00a030), Ernst\u00a0W. Mayr and Nicolas Ollinger (Eds.). Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 743\u2013756. https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2015.743"},{"key":"e_1_3_2_1_44_1","unstructured":"Georg Zetzsche. 2016. Monoids as Storage Mechanisms. Bull. EATCS 120(2016). http:\/\/eatcs.org\/beatcs\/index.php\/beatcs\/article\/view\/459  Georg Zetzsche. 2016. Monoids as Storage Mechanisms. Bull. EATCS 120(2016). http:\/\/eatcs.org\/beatcs\/index.php\/beatcs\/article\/view\/459"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2020.104583"},{"key":"e_1_3_2_1_47_1","volume-title":"RP 2021, Liverpool, UK, October 25-27, 2021, Proceedings(Lecture Notes in Computer Science, Vol.\u00a013035)","author":"Zetzsche Georg","year":"2021","unstructured":"Georg Zetzsche . 2021 . Recent Advances on Reachability Problems for Valence Systems (Invited Talk). In Reachability Problems - 15th International Conference , RP 2021, Liverpool, UK, October 25-27, 2021, Proceedings(Lecture Notes in Computer Science, Vol.\u00a013035) , Paul\u00a0C. Bell, Patrick Totzke, and Igor Potapov (Eds.). Springer, 52\u201365. https:\/\/doi.org\/10.1007\/978-3-030-89716-1_4 10.1007\/978-3-030-89716-1_4 Georg Zetzsche. 2021. Recent Advances on Reachability Problems for Valence Systems (Invited Talk). In Reachability Problems - 15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021, Proceedings(Lecture Notes in Computer Science, Vol.\u00a013035), Paul\u00a0C. Bell, Patrick Totzke, and Igor Potapov (Eds.). Springer, 52\u201365. https:\/\/doi.org\/10.1007\/978-3-030-89716-1_4"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462159"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009848"}],"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.3533345","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3531130.3533345","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.3533345"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,2]]},"references-count":49,"alternative-id":["10.1145\/3531130.3533345","10.1145\/3531130"],"URL":"https:\/\/doi.org\/10.1145\/3531130.3533345","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"}}]}}