Rewriting Systems for Reachability in Vector Addition Systems with Pairs

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 systems and strategies, that allow us to obtain reachability equivalence results between some classes of VASP and VASS. Reachability for the later is well known be equivalent to reachability in Petri nets. VASP generalize also Branching Extension of VASS (BVASS) for which it is unknown if they are more expressive than VASS. We consider here a more restricted notion of reachability for VASP than that for BVASS. However the reachability decision problem corresponding is already equivalent to decidability of the provability in Multiplicative and Exponential Linear Logic (MELL), a question left open for more than 20 years.

• Type: Journal
• Year: 2010
• Where: RP
• Authors: Paulin Jacobé de Naurois, Virgile Mogbil
• Keywords: Control Systems, Reachability, RP 2010, VASP, Vector Addition Systems