{"id":"https://openalex.org/W2092145843","doi":"https://doi.org/10.1016/0304-3975(89)90055-8","title":"Projections of vector addition system reachability sets are semilinear","display_name":"Projections of vector addition system reachability sets are semilinear","publication_year":1989,"publication_date":"1989-05-01","ids":{"openalex":"https://openalex.org/W2092145843","doi":"https://doi.org/10.1016/0304-3975(89)90055-8","mag":"2092145843"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(89)90055-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(89)90055-8","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5037967044","display_name":"Hans Kleine B\u00fcning","orcid":null},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Hans Kleine B\u00fcning","raw_affiliation_strings":["Institut f\u00fcr Angewandte Informatik und Formale Beschreibungsverfahren, Universit\u00e4t Karlsruhe (TH), Fed. Rep. Germany","Univ.-GH-Duisburg, Duisburg, W. Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Angewandte Informatik und Formale Beschreibungsverfahren, Universit\u00e4t Karlsruhe (TH), Fed. Rep. Germany","institution_ids":["https://openalex.org/I102335020"]},{"raw_affiliation_string":"Univ.-GH-Duisburg, Duisburg, W. Germany#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114253716","display_name":"Theodor Lettmann","orcid":null},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Theodor Lettmann","raw_affiliation_strings":["Institut f\u00fcr Angewandte Informatik und Formale Beschreibungsverfahren, Universit\u00e4t Karlsruhe (TH), Fed. Rep. Germany","Univ.-GH-Duisburg, Duisburg, W. Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Angewandte Informatik und Formale Beschreibungsverfahren, Universit\u00e4t Karlsruhe (TH), Fed. Rep. Germany","institution_ids":["https://openalex.org/I102335020"]},{"raw_affiliation_string":"Univ.-GH-Duisburg, Duisburg, W. Germany#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109876781","display_name":"Ernst Mayr","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ernst W. Mayr","raw_affiliation_strings":["Department of Computer Science, Stanford University, U.S.A","Univ.-GH-Duisburg, Duisburg, W. Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Stanford University, U.S.A","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Univ.-GH-Duisburg, Duisburg, W. Germany#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5037967044"],"corresponding_institution_ids":["https://openalex.org/I102335020"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.24799657,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"64","issue":"3","first_page":"343","last_page":"350"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9983999729156494,"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.9983999729156494,"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.9804999828338623,"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/T12084","display_name":"Synthesis and properties of polymers","score":0.9717000126838684,"subfield":{"id":"https://openalex.org/subfields/2507","display_name":"Polymers and Plastics"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.9457164406776428},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.8920730352401733},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.850972056388855},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.7865574955940247},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6898571848869324},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.6249151825904846},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5489259362220764},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5217448472976685},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49648839235305786},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4306764602661133},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3841628432273865},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1957249641418457},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16602525115013123}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9457164406776428},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.8920730352401733},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.850972056388855},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.7865574955940247},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6898571848869324},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.6249151825904846},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5489259362220764},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5217448472976685},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49648839235305786},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4306764602661133},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3841628432273865},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1957249641418457},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16602525115013123},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0304-3975(89)90055-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(89)90055-8","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.8399999737739563,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1514194201","https://openalex.org/W2013504313","https://openalex.org/W2017315323","https://openalex.org/W2106001218","https://openalex.org/W2164003033","https://openalex.org/W2316437449","https://openalex.org/W6630618315"],"related_works":["https://openalex.org/W2020140696","https://openalex.org/W2584984136","https://openalex.org/W2591956186","https://openalex.org/W1553002193","https://openalex.org/W1805200712","https://openalex.org/W1563786920","https://openalex.org/W4288581691","https://openalex.org/W2951140680","https://openalex.org/W2912654482","https://openalex.org/W1993478572"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}