{"id":"https://openalex.org/W2965199304","doi":"https://doi.org/10.1109/lics.2019.8785796","title":"Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension","display_name":"Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension","publication_year":2019,"publication_date":"2019-06-01","ids":{"openalex":"https://openalex.org/W2965199304","doi":"https://doi.org/10.1109/lics.2019.8785796","mag":"2965199304"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2019.8785796","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2019.8785796","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.5","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014652670","display_name":"J\u00e9r\u00f4me Leroux","orcid":"https://orcid.org/0000-0002-7214-9467"},"institutions":[{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I4210160189","display_name":"Institut Polytechnique de Bordeaux","ror":"https://ror.org/054qv7y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jerome Leroux","raw_affiliation_strings":["LaBRI, Universit\u00e9 de Bordeaux, France","LaBRI - Laboratoire Bordelais de Recherche en Informatique (Domaine Universitaire 351, cours de la Lib\u00e9ration 33405 Talence Cedex - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LaBRI, Universit\u00e9 de Bordeaux, France","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210160189"]},{"raw_affiliation_string":"LaBRI - Laboratoire Bordelais de Recherche en Informatique (Domaine Universitaire 351, cours de la Lib\u00e9ration 33405 Talence Cedex - France)","institution_ids":["https://openalex.org/I4210142254"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042421707","display_name":"Sylvain Schmitz","orcid":"https://orcid.org/0000-0002-4101-4308"},"institutions":[{"id":"https://openalex.org/I185839726","display_name":"Institut Universitaire de France","ror":"https://ror.org/055khg266","country_code":"FR","type":"education","lineage":["https://openalex.org/I185839726"]},{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]},{"id":"https://openalex.org/I4210104198","display_name":"Laboratoire Sp\u00e9cification et V\u00e9rification","ror":"https://ror.org/01kz1bj67","country_code":"FR","type":"facility","lineage":["https://openalex.org/I11559806","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210104198","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Sylvain Schmitz","raw_affiliation_strings":["LSV, Universit\u00e9 Paris-Saclay, France","LSV - Laboratoire Sp\u00e9cification et V\u00e9rification [Cachan] (B\u00e2timent d'Alembert 61 Avenue du Pr\u00e9sident Wilson 94235 CACHAN CEDEX - France)","IUF - Institut universitaire de France (Maison des Universit\u00e9s 103 Boulevard Saint-Michel 75005 Paris - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LSV, Universit\u00e9 Paris-Saclay, France","institution_ids":["https://openalex.org/I277688954"]},{"raw_affiliation_string":"LSV - Laboratoire Sp\u00e9cification et V\u00e9rification [Cachan] (B\u00e2timent d'Alembert 61 Avenue du Pr\u00e9sident Wilson 94235 CACHAN CEDEX - France)","institution_ids":["https://openalex.org/I4210104198"]},{"raw_affiliation_string":"IUF - Institut universitaire de France (Maison des Universit\u00e9s 103 Boulevard Saint-Michel 75005 Paris - France)","institution_ids":["https://openalex.org/I185839726"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.55,"has_fulltext":true,"cited_by_count":61,"citation_normalized_percentile":{"value":0.97167868,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"13"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11424","display_name":"Security and Verification in Computing","score":0.9865000247955322,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8861957788467407},{"id":"https://openalex.org/keywords/ackermann-function","display_name":"Ackermann function","score":0.7583739757537842},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6686142683029175},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.6481279730796814},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5224696397781372},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3582914471626282},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34817296266555786},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.29891669750213623}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8861957788467407},{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.7583739757537842},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6686142683029175},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6481279730796814},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5224696397781372},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3582914471626282},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34817296266555786},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.29891669750213623},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/lics.2019.8785796","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2019.8785796","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},{"id":"pmh:oai:drops-oai.dagstuhl.de:10949","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.5","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:arXiv.org:1903.08575","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1903.08575","pdf_url":"https://arxiv.org/pdf/1903.08575","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-02267524v1","is_oa":true,"landing_page_url":"https://hal.science/hal-02267524","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"LICS 2019, 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2019, Vancouver, Canada. pp.1--13, ⟨10.1109/LICS.2019.8785796⟩","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"doi:10.4230/lipics.mfcs.2019.5","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.mfcs.2019.5","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:10949","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.5","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.7699999809265137,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G4076119974","display_name":"IDEAL-BASED ALGORITHMS FOR VASSES AND WELL-STRUCTURED SYSTEMS","funder_award_id":"ANR-17-CE40-0028","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G4266529059","display_name":"Proof systems for data queries","funder_award_id":"ANR-14-CE28-0005","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G6803667113","display_name":null,"funder_award_id":"ANR-17","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W137988827","https://openalex.org/W225519172","https://openalex.org/W1503681652","https://openalex.org/W1524248088","https://openalex.org/W1532209667","https://openalex.org/W1545252802","https://openalex.org/W1556056959","https://openalex.org/W1625359640","https://openalex.org/W1646789098","https://openalex.org/W1932636156","https://openalex.org/W1989788631","https://openalex.org/W2010265885","https://openalex.org/W2011495892","https://openalex.org/W2014030742","https://openalex.org/W2014322000","https://openalex.org/W2017315323","https://openalex.org/W2020050887","https://openalex.org/W2055081868","https://openalex.org/W2087749569","https://openalex.org/W2106001218","https://openalex.org/W2133496908","https://openalex.org/W2167003332","https://openalex.org/W2271542264","https://openalex.org/W2344518945","https://openalex.org/W2387849862","https://openalex.org/W2772428078","https://openalex.org/W2788327719","https://openalex.org/W2907771222","https://openalex.org/W2922024459","https://openalex.org/W2950717082","https://openalex.org/W2953277933","https://openalex.org/W2963114834","https://openalex.org/W2963150833","https://openalex.org/W2963604037","https://openalex.org/W2963620995","https://openalex.org/W3098342602","https://openalex.org/W3104838059","https://openalex.org/W3118222663","https://openalex.org/W3125224867","https://openalex.org/W4213117200","https://openalex.org/W4300187043","https://openalex.org/W4300554519","https://openalex.org/W4321594986","https://openalex.org/W6686808864","https://openalex.org/W6711154863","https://openalex.org/W6732683221"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2076743759","https://openalex.org/W4235144492","https://openalex.org/W4388435768","https://openalex.org/W2756792282","https://openalex.org/W2756744637","https://openalex.org/W2759493398","https://openalex.org/W3082487952","https://openalex.org/W3040348990","https://openalex.org/W4288357225"],"abstract_inverted_index":{"The":[0,31],"reachability":[1],"problem":[2,39],"in":[3,28,75,83],"vector":[4],"addition":[5],"systems":[6,46],"is":[7,40,101],"a":[8],"central":[9],"question,":[10],"not":[11,41,89],"only":[12],"for":[13,22,98,103],"the":[14,55,76,91],"static":[15],"verification":[16],"of":[17,47,59],"these":[18],"systems,":[19],"but":[20],"also":[21],"many":[23],"inter-reducible":[24],"decision":[25],"problems":[26],"occurring":[27],"various":[29],"fields.":[30],"currently":[32,92],"best":[33,93],"known":[34,94],"upper":[35,73,81],"bound":[36,74,97],"on":[37],"this":[38,87],"primitive-recursive,":[42],"even":[43],"when":[44],"considering":[45],"fixed":[48,84],"dimension.":[49,85],"We":[50],"provide":[51],"significant":[52],"refinements":[53],"to":[54,65],"classical":[56],"decomposition":[57],"algorithm":[58],"Mayr,":[60],"Kosaraju,":[61],"and":[62,64,79],"Lambert":[63],"its":[66],"termination":[67],"proof,":[68],"which":[69],"yield":[70],"an":[71],"ACKERMANN":[72],"general":[77],"case,":[78],"primitive-recursive":[80],"bounds":[82],"While":[86],"does":[88],"match":[90],"TOWER":[95],"lower":[96],"reachability,":[99],"it":[100],"optimal":[102],"related":[104],"problems.":[105]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":12},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-03T08:13:44.112507","created_date":"2019-08-13T00:00:00"}