Vector Addition Tree Automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2004

Vector Addition Tree Automata


We introduce a new class of automata, which we call vector addition tree automata. These automata are a natural generalization of vector addition systems with states, which are themselves equivalent to Petri nets. Then, we prove that the decidability of provability in multiplicative exponential linear logic (which is an open problem) is equivalent to the decidability of the reachability relation for vector addition tree automata. This result generalizes the well-known connection existing between Petri nets and the !-Horn fragment of multiplicative exponential linear logic.


Other [cs.OH]
Not file

Dates and versions

inria-00100081 , version 1 (26-09-2006)


  • HAL Id : inria-00100081 , version 1


Philippe de Groote, Bruno Guillaume, Sylvain Salvati. Vector Addition Tree Automata. 19th Annual IEEE Symposium on Logic in Computer Science - LICS'04, 2004, Turku, Finland, France. pp.64-73. ⟨inria-00100081⟩
222 View
0 Download


Gmail Facebook Twitter LinkedIn More