{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:18Z","timestamp":1750220658715,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T00:00:00Z","timestamp":1594166400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100011199","name":"European Research Council","doi-asserted-by":"publisher","award":["683080"],"award-info":[{"award-number":["683080"]}],"id":[{"id":"10.13039\/100011199","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,8]]},"DOI":"10.1145\/3373718.3394776","type":"proceedings-article","created":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T00:23:18Z","timestamp":1590452598000},"page":"341-354","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["An Approach to Regular Separability in Vector Addition Systems"],"prefix":"10.1145","author":[{"given":"Wojciech","family":"Czerwi\u0144ski","sequence":"first","affiliation":[{"name":"University of Warsaw"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georg","family":"Zetzsche","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Software Systems (MPI-SWS)"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,7,8]]},"reference":[{"volume-title":"Transductions and context-free languages. Teubner Studienb\u00fccher","author":"Berstel Jean","key":"e_1_3_2_1_1_1","unstructured":"Jean Berstel . 1979. Transductions and context-free languages. Teubner Studienb\u00fccher , Stuttgart . Jean Berstel. 1979. Transductions and context-free languages. Teubner Studienb\u00fccher, Stuttgart."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2017-1551"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/2012013"},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of ICALP '17","author":"Clemente Lorenzo","year":"2017","unstructured":"Lorenzo Clemente , Wojciech Czerwi\u0144ski , S\u0142awomir Lasota , and Charles Paperman . 2017 . Regular Separability of Parikh Automata . In Proceedings of ICALP '17 . 117:1--117:13. Lorenzo Clemente, Wojciech Czerwi\u0144ski, S\u0142awomir Lasota, and Charles Paperman. 2017. Regular Separability of Parikh Automata. In Proceedings of ICALP '17. 117:1--117:13."},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of STACS '17","author":"Clemente Lorenzo","year":"2017","unstructured":"Lorenzo Clemente , Wojciech Czerwi\u0144ski , S\u0142awomir Lasota , and Charles Paperman . 2017 . Separability of Reachability Sets of Vector Addition Systems . In Proceedings of STACS '17 . 24:1--24:14. Lorenzo Clemente, Wojciech Czerwi\u0144ski, S\u0142awomir Lasota, and Charles Paperman. 2017. Separability of Reachability Sets of Vector Addition Systems. In Proceedings of STACS '17. 24:1--24:14."},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of ICALP '18","author":"Czerwi\u0144ski Wojciech","year":"2018","unstructured":"Wojciech Czerwi\u0144ski , Piotr Hofman , and Georg Zetzsche . 2018 . Unboundedness Problems for Languages of Vector Addition Systems . In Proceedings of ICALP '18 . 119:1--119:15. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.119 10.4230\/LIPIcs.ICALP.2018.119 Wojciech Czerwi\u0144ski, Piotr Hofman, and Georg Zetzsche. 2018. Unboundedness Problems for Languages of Vector Addition Systems. In Proceedings of ICALP '18. 119:1--119:15. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.119"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2017.8005079"},{"key":"e_1_3_2_1_8_1","volume-title":"The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract). CoRR abs\/1809.07115","author":"Czerwi\u0144ski Wojciech","year":"2018","unstructured":"Wojciech Czerwi\u0144ski , S\u0142awomir Lasota , Ranko Lazic , J\u00e9r\u00f4me Leroux , and Filip Mazowiecki . 2018. The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract). CoRR abs\/1809.07115 ( 2018 ). Wojciech Czerwi\u0144ski, S\u0142awomir Lasota, Ranko Lazic, J\u00e9r\u00f4me Leroux, and Filip Mazowiecki. 2018. The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract). CoRR abs\/1809.07115 (2018)."},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of CONCUR '18","author":"Czerwi\u0144ski Wojciech","year":"2018","unstructured":"Wojciech Czerwi\u0144ski , Slawomir Lasota , Roland Meyer , Sebastian Muskalla , K. Narayan Kumar , and Prakash Saivasan . 2018 . Regular Separability of Well-Structured Transition Systems . In Proceedings of CONCUR '18 . 35:1--35:18. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2018.35 10.4230\/LIPIcs.CONCUR.2018.35 Wojciech Czerwi\u0144ski, Slawomir Lasota, Roland Meyer, Sebastian Muskalla, K. Narayan Kumar, and Prakash Saivasan. 2018. Regular Separability of Well-Structured Transition Systems. In Proceedings of CONCUR '18. 35:1--35:18. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2018.35"},{"key":"e_1_3_2_1_10_1","volume-title":"A Characterization for Decidable Separability by Piecewise Testable Languages. Discrete Mathematics & Theoretical Computer Science 19, 4","author":"Czerwi\u0144ski Wojciech","year":"2017","unstructured":"Wojciech Czerwi\u0144ski , Wim Martens , Lorijn van Rooijen , Marc Zeitoun , and Georg Zetzsche . 2017. A Characterization for Decidable Separability by Piecewise Testable Languages. Discrete Mathematics & Theoretical Computer Science 19, 4 ( 2017 ). Wojciech Czerwi\u0144ski, Wim Martens, Lorijn van Rooijen, Marc Zeitoun, and Georg Zetzsche. 2017. A Characterization for Decidable Separability by Piecewise Testable Languages. Discrete Mathematics & Theoretical Computer Science 19, 4 (2017)."},{"key":"e_1_3_2_1_11_1","volume-title":"Well-structured transition systems everywhere! Theoretical Computer Science 256, 1-2","author":"Finkel Alain","year":"2001","unstructured":"Alain Finkel and Philippe Schnoebelen . 2001. Well-structured transition systems everywhere! Theoretical Computer Science 256, 1-2 ( 2001 ), 63--92. https:\/\/doi.org\/10.1016\/S0304-3975(00)00102-X 10.1016\/S0304-3975(00)00102-X Alain Finkel and Philippe Schnoebelen. 2001. Well-structured transition systems everywhere! Theoretical Computer Science 256, 1-2 (2001), 63--92. https:\/\/doi.org\/10.1016\/S0304-3975(00)00102-X"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-007-0050-3"},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of ICALP '16","author":"Goubault-Larrecq Jean","year":"2016","unstructured":"Jean Goubault-Larrecq and Sylvain Schmitz . 2016 . Deciding Piecewise Testable Separability for Regular Tree Languages . In Proceedings of ICALP '16 . 97:1--97:15. Jean Goubault-Larrecq and Sylvain Schmitz. 2016. Deciding Piecewise Testable Separability for Regular Tree Languages. In Proceedings of ICALP '16. 97:1--97:15."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(78)90020-8"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11439-2_9"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14162-1_39"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90041-0"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/322307.322317"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/1979130100191"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90006-4"},{"key":"e_1_3_2_1_21_1","volume-title":"Proceedings of SOFSEM '17","author":"Jan\u010dar Petr","year":"2017","unstructured":"Petr Jan\u010dar . 2017 . Deciding Structural Liveness of Petri Nets . In Proceedings of SOFSEM '17 . 91--102. Petr Jan\u010dar. 2017. Deciding Structural Liveness of Petri Nets. In Proceedings of SOFSEM '17. 91--102."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802201"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90173-D"},{"volume-title":"Linear Algebra","author":"Lang Serge","key":"e_1_3_2_1_24_1","unstructured":"Serge Lang . 1966. Linear Algebra . Addison-Wesley . Serge Lang. 1966. Linear Algebra. Addison-Wesley."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2733375"},{"volume-title":"Concurrency, Security, and Puzzles --- Essays Dedicated to Andrew William Roscoe on the Occasion of His 60thBirthday (LNCS)","author":"Lazi\u0107 Ranko","key":"e_1_3_2_1_26_1","unstructured":"Ranko Lazi\u0107 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 60thBirthday (LNCS) , Vol. 10160 . Springer , 144--161. Ranko Lazi\u0107 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 60thBirthday (LNCS), Vol. 10160. Springer, 144--161."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2009.10"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926421"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.16"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802477"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.28"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40313-2_64"},{"key":"e_1_3_2_1_33_1","volume-title":"Proceedings of STACS '15","author":"Place Thomas","year":"2015","unstructured":"Thomas Place and Marc Zeitoun . 2015 . Separation and the Successor Relation . In Proceedings of STACS '15 . 662--675. Thomas Place and Marc Zeitoun. 2015. Separation and the Successor Relation. In Proceedings of STACS '15. 662--675."},{"key":"e_1_3_2_1_34_1","volume-title":"Separating Regular Languages with First-Order Logic. Logical Methods in Computer Science 12, 1","author":"Place Thomas","year":"2016","unstructured":"Thomas Place and Marc Zeitoun . 2016. Separating Regular Languages with First-Order Logic. Logical Methods in Computer Science 12, 1 ( 2016 ). Thomas Place and Marc Zeitoun. 2016. Separating Regular Languages with First-Order Logic. Logical Methods in Computer Science 12, 1 (2016)."},{"key":"e_1_3_2_1_35_1","volume-title":"Old Wine. In Proceedings of CSR '17","author":"Place Thomas","year":"2017","unstructured":"Thomas Place and Marc Zeitoun . 2017 . Concatenation Hierarchies: New Bottle , Old Wine. In Proceedings of CSR '17 . 25--37. Thomas Place and Marc Zeitoun. 2017. Concatenation Hierarchies: New Bottle, Old Wine. In Proceedings of CSR '17. 25--37."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2017.8005070"},{"volume-title":"Proceedings of STOC '77","author":"George","key":"e_1_3_2_1_37_1","unstructured":"George S. Sacerdote and Richard L. Tenney. 1977. The decidability of the reachability problem for vector addition systems (preliminary version) . In Proceedings of STOC '77 . ACM, 61--76. George S. Sacerdote and Richard L. Tenney. 1977. The decidability of the reachability problem for vector addition systems (preliminary version). In Proceedings of STOC '77. ACM, 61--76."},{"volume-title":"Theory of linear and integer programming","author":"Schrijver Alexander","key":"e_1_3_2_1_38_1","unstructured":"Alexander Schrijver . 1986. Theory of linear and integer programming . John Wiley & Sons . Alexander Schrijver. 1986. Theory of linear and integer programming. John Wiley & Sons."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/0205019"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47666-6_35"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209108.3209201"}],"event":{"name":"LICS '20: 35th Annual ACM\/IEEE Symposium on Logic in Computer Science","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society"],"location":"Saarbr\u00fccken Germany","acronym":"LICS '20"},"container-title":["Proceedings of the 35th Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373718.3394776","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3373718.3394776","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:35Z","timestamp":1750197755000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373718.3394776"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,8]]},"references-count":41,"alternative-id":["10.1145\/3373718.3394776","10.1145\/3373718"],"URL":"https:\/\/doi.org\/10.1145\/3373718.3394776","relation":{},"subject":[],"published":{"date-parts":[[2020,7,8]]},"assertion":[{"value":"2020-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}