31 search results - page 1 / 7 » Rewriting Systems for Reachability in Vector Addition System... |
RP
2010
Springer
13 years 2 months ago
2010
Springer
We adapt hypergraph rewriting system to a generalization of Vector Addition Systems with States (VASS) that we call vector addition systems with pairs (VASP). We give rewriting sys...
STACS
2007
Springer
13 years 10 months ago
2007
Springer
We consider commutative string rewriting systems (Vector Addition Systems, Petri nets), i.e., string rewriting systems in which all pairs of letters commute. We are interested in r...
IPL
2010
13 years 2 months ago
2010
Branching vector addition systems are an extension of vector addition systems where new reachable vectors may be obtained by summing two reachable vectors and adding an integral v...
FSTTCS
2010
Springer
13 years 2 months ago
2010
Springer
Reachability and boundedness problems have been shown decidable for Vector Addition Systems with one zero-test. Surprisingly, place-boundedness remained open. We provide here a va...
LICS
2009
IEEE
13 years 11 months ago
2009
IEEE
The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known decidable by algorithms exclusively based on the class...