Karp-Miller trees for a branching extension of VASS

MaRDI QIDQ5387658zbMATH OpenFDO

Authors Kumar Neeraj Verma, Jean Goubault-Larrecq

Publication date 27 May 2008

Full work available at URL https://eudml.org/doc/129486, https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/issue/view/53/showToc.html

Mathematics Subject Classification ID

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

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

Cited in

(15)

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

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)