Skip to Main content Skip to Navigation
Journal articles

Karp-Miller Trees for a Branching Extension of VASS

Kumar Neeraj Verma 1 Jean Goubault-Larrecq 2, 3
3 SECSI - Security of information systems
LSV - Laboratoire Spécification et Vérification [Cachan], ENS Cachan - École normale supérieure - Cachan, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8643
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.
Document type :
Journal articles
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download

https://hal.inria.fr/hal-00959038
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Thursday, March 13, 2014 - 5:08:47 PM
Last modification on : Friday, June 4, 2021 - 1:32:02 PM
Long-term archiving on: : Friday, June 13, 2014 - 12:17:35 PM

File

dm070113.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00959038, version 1

Citation

Kumar Neeraj Verma, Jean Goubault-Larrecq. Karp-Miller Trees for a Branching Extension of VASS. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2005, 7, pp.217-230. ⟨hal-00959038⟩

Share

Metrics

Record views

426

Files downloads

1028