Karp-Miller trees for a branching extension of VASS

zbMATH Open1152.68462MaRDI QIDQ5387658FDOQ5387658

Authors: Kumar Neeraj Verma, Jean Goubault-Larrecq 

Publication date: 27 May 2008

Full work available at URL: https://eudml.org/doc/129486

Recommendations

• A polynomial-time algorithm for reachability in branching VASS in dimension one
• ML and extended branching VASS
• Logics of repeating values on data trees and branching counter systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Cited In (12)

• The ideal view on Rackoff's coverability technique
• The reachability problem for branching vector addition systems requires doubly-exponential space
• On the complexity of resource-bounded logics
• ML and extended branching VASS
• Alternating two-way AC-tree automata
• Forward analysis for WSTS, part I: completions
• Forward analysis for WSTS. III: Karp-Miller trees
• Forward analysis for WSTS. III: Karp-Miller trees
• Logics of repeating values on data trees and branching counter systems
• Commutative Lambek grammars
• Decidable models of integer-manipulating programs with recursive parallelism
• Strategic reasoning with a bounded number of resources: the quest for tractability

This page was built for publication: Karp-Miller trees for a branching extension of VASS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387658)