{"id":"https://openalex.org/W4250700008","doi":"https://doi.org/10.1109/lics.2004.1319601","title":"Vector addition tree automata","display_name":"Vector addition tree automata","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W4250700008","doi":"https://doi.org/10.1109/lics.2004.1319601"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2004.1319601","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2004.1319601","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.","raw_type":"proceedings-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/A5112819825","display_name":"Philippe de Groote","orcid":null},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"P. de Groote","raw_affiliation_strings":["LORIA, UMR n 7503-INRIA, Vandoeuvre-les-Nancy, France"],"affiliations":[{"raw_affiliation_string":"LORIA, UMR n 7503-INRIA, Vandoeuvre-les-Nancy, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210121838"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5106387277","display_name":"Bruno Guillaume","orcid":"https://orcid.org/0000-0001-8314-8075"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"B. Guillaume","raw_affiliation_strings":["LORIA, UMR n 7503-INRIA, Vandoeuvre-les-Nancy, France"],"affiliations":[{"raw_affiliation_string":"LORIA, UMR n 7503-INRIA, Vandoeuvre-les-Nancy, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210121838"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039758270","display_name":"Sylvain Salvati","orcid":"https://orcid.org/0000-0002-6230-0098"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"S. Salvati","raw_affiliation_strings":["LORIA, UMR n 7503-INRIA, Vandoeuvre-les-Nancy, France"],"affiliations":[{"raw_affiliation_string":"LORIA, UMR n 7503-INRIA, Vandoeuvre-les-Nancy, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210121838"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5112819825"],"corresponding_institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210121838"],"apc_list":null,"apc_paid":null,"fwci":2.42,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.89369612,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"29","issue":null,"first_page":"64","last_page":"73"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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.9994000196456909,"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.9986000061035156,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9980999827384949,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6651310920715332},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.6240644454956055},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.5673468112945557},{"id":"https://openalex.org/keywords/linear-logic","display_name":"Linear logic","score":0.5371127724647522},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.5368232131004333},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5365725755691528},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5010867118835449},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4860859215259552},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4341075122356415},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.42330414056777954},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.41620123386383057},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41122978925704956},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2778226435184479},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26563483476638794},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.23465439677238464}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6651310920715332},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.6240644454956055},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.5673468112945557},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.5371127724647522},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.5368232131004333},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5365725755691528},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5010867118835449},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4860859215259552},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4341075122356415},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.42330414056777954},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.41620123386383057},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41122978925704956},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2778226435184479},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26563483476638794},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23465439677238464},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lics.2004.1319601","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2004.1319601","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1593799327","https://openalex.org/W1692205652","https://openalex.org/W1981021681","https://openalex.org/W2017315323","https://openalex.org/W2024442214","https://openalex.org/W2044541206","https://openalex.org/W2082529483","https://openalex.org/W2106001218","https://openalex.org/W2127889926","https://openalex.org/W2151402914","https://openalex.org/W2164003033","https://openalex.org/W2336084445","https://openalex.org/W2911858301","https://openalex.org/W2911865844","https://openalex.org/W6613347261","https://openalex.org/W6633965075","https://openalex.org/W6679702467"],"related_works":["https://openalex.org/W2150468037","https://openalex.org/W2032269072","https://openalex.org/W2951140680","https://openalex.org/W2912654482","https://openalex.org/W1999231617","https://openalex.org/W2099490078","https://openalex.org/W277366380","https://openalex.org/W4297362790","https://openalex.org/W2537940722","https://openalex.org/W2127007650"],"abstract_inverted_index":{"We":[0],"introduce":[1],"a":[2,17],"new":[3],"class":[4],"of":[5,20,38,55,78],"automata,":[6],"which":[7,26],"we":[8,33],"call":[9],"vector":[10,21,60],"addition":[11,22,61],"tree":[12,62],"automata.":[13,63],"These":[14],"automata":[15],"are":[16,27],"natural":[18],"generalization":[19],"systems":[23],"with":[24],"states,":[25],"themselves":[28],"equivalent":[29,51],"to":[30,52],"Petri-nets.":[31],"Then,":[32],"prove":[34],"that":[35],"the":[36,53,56,67,75],"decidability":[37,54],"provability":[39],"in":[40],"multiplicative":[41,79],"exponential":[42,80],"linear":[43,81],"logic":[44],"(which":[45],"is":[46,50],"an":[47],"open":[48],"problem)":[49],"reachability":[57],"relation":[58],"for":[59],"This":[64],"result":[65],"generalizes":[66],"well-known":[68],"connection":[69],"existing":[70],"between":[71],"Petri":[72],"nets":[73],"and":[74],"!-horn":[76],"fragment":[77],"logic.":[82]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-17T05:58:53.018234","created_date":"2025-10-10T00:00:00"}