Karp-Miller Trees for a Branching Extension of VASS - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2005

Karp-Miller Trees for a Branching Extension of VASS

Abstract

We study BVASS (Branching VASS) which extend VASS (Vector Addition Systems with States) by allowing addition transitions that merge two configurations. Runs in BVASS are tree-like structures instead of linear ones as for VASS. We show that the construction of Karp-Miller trees for VASS can be extended to BVASS. This entails that the coverability set for BVASS is computable. This allows us to obtain decidability results for certain classes of equational tree automata with an associative-commutative symbol. Recent independent work by de Groote et al. implies that decidability of reachability in BVASS is equivalent to decidability of provability in MELL (multiplicative exponential linear logic), which is still an open problem. Hence our results are also a step towards answering this question in the affirmative.
Fichier principal
Vignette du fichier
dm070113.pdf (232.47 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00959038 , version 1 (13-03-2014)

Identifiers

Cite

Kumar Neeraj Verma, Jean Goubault-Larrecq. Karp-Miller Trees for a Branching Extension of VASS. Discrete Mathematics and Theoretical Computer Science, 2005, Vol. 7, pp.217-230. ⟨10.46298/dmtcs.350⟩. ⟨hal-00959038⟩
198 View
898 Download

Altmetric

Share

Gmail Facebook X LinkedIn More