{"id":"https://openalex.org/W4240047891","doi":"https://doi.org/10.1145/3527372.3527374","title":"Algorithmic analysis of termination and counter complexity in vector addition systems with states","display_name":"Algorithmic analysis of termination and counter complexity in vector addition systems with states","publication_year":2021,"publication_date":"2021-10-01","ids":{"openalex":"https://openalex.org/W4240047891","doi":"https://doi.org/10.1145/3527372.3527374"},"language":"en","primary_location":{"id":"doi:10.1145/3527372.3527374","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3527372.3527374","pdf_url":null,"source":{"id":"https://openalex.org/S4210221220","display_name":"ACM SIGLOG News","issn_l":"2372-3491","issn":["2372-3491"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGLOG News","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019575165","display_name":"Anton\u0131\u0301n Ku\u010dera","orcid":"https://orcid.org/0000-0002-6602-8028"},"institutions":[{"id":"https://openalex.org/I21449261","display_name":"Masaryk University","ror":"https://ror.org/02j46qs45","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21449261"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Anton\u00edn Ku\u010dera","raw_affiliation_strings":["Masaryk University, Czechia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Masaryk University, Czechia","institution_ids":["https://openalex.org/I21449261"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5019575165"],"corresponding_institution_ids":["https://openalex.org/I21449261"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.26505265,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"8","issue":"4","first_page":"4","last_page":"21"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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.9997000098228455,"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.996999979019165,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.8624862432479858},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.8231381177902222},{"id":"https://openalex.org/keywords/liveness","display_name":"Liveness","score":0.7464466691017151},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.741566002368927},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5766206383705139},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5545738935470581},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4922622740268707},{"id":"https://openalex.org/keywords/contrast","display_name":"Contrast (vision)","score":0.47236543893814087},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.44368210434913635},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4090649485588074},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3736302852630615},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36888226866722107},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26995325088500977},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0741967260837555}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8624862432479858},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8231381177902222},{"id":"https://openalex.org/C15569618","wikidata":"https://www.wikidata.org/wiki/Q3561421","display_name":"Liveness","level":2,"score":0.7464466691017151},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.741566002368927},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5766206383705139},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5545738935470581},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4922622740268707},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.47236543893814087},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.44368210434913635},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4090649485588074},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3736302852630615},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36888226866722107},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26995325088500977},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0741967260837555}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3527372.3527374","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3527372.3527374","pdf_url":null,"source":{"id":"https://openalex.org/S4210221220","display_name":"ACM SIGLOG News","issn_l":"2372-3491","issn":["2372-3491"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGLOG News","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.6499999761581421,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W615345195","https://openalex.org/W1975261774","https://openalex.org/W2017315323","https://openalex.org/W2577171054","https://openalex.org/W3022740807","https://openalex.org/W3029036723","https://openalex.org/W6619233846"],"related_works":["https://openalex.org/W2961758588","https://openalex.org/W2099490078","https://openalex.org/W4288581691","https://openalex.org/W2951140680","https://openalex.org/W2912654482","https://openalex.org/W2103504376","https://openalex.org/W2153337086","https://openalex.org/W2135051863","https://openalex.org/W2150468037","https://openalex.org/W1651168384"],"abstract_inverted_index":{"We":[0,59],"give":[1],"an":[2],"overview":[3],"of":[4,13,18],"recently":[5],"established":[6],"results":[7],"about":[8],"the":[9,36],"effective":[10],"asymptotic":[11,42],"analysis":[12,43],"termination":[14],"and":[15,49,64],"counter":[16],"complexity":[17,48],"VASS":[19,41],"computations.":[20],"In":[21],"contrast":[22],"to":[23,40,45,67],"\"classical\"":[24],"problems":[25,38],"such":[26],"as":[27],"reachability,":[28],"boundedness,":[29],"liveness,":[30],"coverability,":[31],"etc.,":[32],"that":[33],"are":[34,53],"EXPSPACE-hard,":[35],"decision":[37],"related":[39],"tend":[44],"have":[46],"low":[47],"many":[50],"important":[51],"variants":[52],"even":[54],"decidable":[55],"in":[56],"polynomial":[57],"time.":[58],"also":[60],"present":[61],"selected":[62],"concepts":[63],"techniques":[65],"used":[66],"achieve":[68],"these":[69],"results.":[70]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}