The covering and boundedness problems for branching vector addition systems
DOI10.1016/J.JCSS.2012.04.002zbMATH Open1260.68264OpenAlexW2066170410MaRDI QIDQ1936244FDOQ1936244
Oded Lachish, Stéphane Demri, Ranko Lazić, Marcin Jurdziński
Publication date: 21 February 2013
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2012.04.002
Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (14)
- Constructive decision via redundancy-free proof-search
- The ideal view on Rackoff's coverability technique
- Coverability and Termination in Recursive Petri Nets
- On the complexity of resource-bounded logics
- Title not available (Why is that?)
- Nonelementary Complexities for Branching VASS, MELL, and Extensions
- IMPLICATIONAL RELEVANCE LOGIC IS 2-EXPTIME-COMPLETE
- Coverability, Termination, and Finiteness in Recursive Petri Nets
- Decidable models of integer-manipulating programs with recursive parallelism
- On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension
- Strategic reasoning with a bounded number of resources: the quest for tractability
- Logics of Repeating Values on Data Trees and Branching Counter Systems
- Expand, Enlarge, and Check for Branching Vector Addition Systems
- Title not available (Why is that?)
This page was built for publication: The covering and boundedness problems for branching vector addition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1936244)
