Rewriting systems for reachability in vector addition systems with pairs

Authors:
Paulin Jacobé De Naurois;Virgile Mogbil
Affiliations:
LIPN, UMR, CNRS, Université Paris 13, Institut Galilée, Villetaneuse, France;LIPN, UMR, CNRS, Université Paris 13, Institut Galilée, Villetaneuse, France
Venue:
RP'10 Proceedings of the 4th international conference on Reachability problems
Year:
2010

Citing 10
Cited 0

Linear logic

Theoretical Computer Science
A structure to decide reachability in Petri nets

Theoretical Computer Science
Directed hypergraphs and applications

Discrete Applied Mathematics - Special issue: combinatorial structures and algorithms
Termination of graph rewriting is undecidable

Fundamenta Informaticae
On Context-Free Languages

Journal of the ACM (JACM)
The reachability problem for VAS

Proceedings of the European Workshop on Applications and Theory in Petri Nets, covers the last two years which include the workshop 1983 in Toulouse and the workshop 1984 in Aarhus, selected papers
Decidability of reachability in vector addition systems (Preliminary Version)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Vector Addition Tree Automata

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Alternating two-way AC-tree automata

Information and Computation
Parallel program schemata

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.