*For the most recent entries see the
Petri Nets Newsletter.*

## Vector Addition Tree Automata.

de Groote, Philippe;
Guillaume, Bruno;
Salvati, Sylvain
In:
*Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS'04), July 13 - 17, 2004, Turku, Finland*, pages 64-73.
July 2004.

Abstract:
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.

*Do you need a refined search? Try our search engine
which allows complex field-based queries.*
*Back to the Petri Nets Bibliography*