Sciweavers

77 search results - page 1 / 16
» On Boundedness Problems for Pushdown Vector Addition Systems
Sort
View
FSTTCS
2009
Springer
13 years 11 months ago
The Covering and Boundedness Problems for Branching Vector Addition Systems
The covering and boundedness problems for branching vector addition systems are shown complete for doubly-exponential time.
Stéphane Demri, Marcin Jurdzinski, Oded Lac...
FSTTCS
2010
Springer
13 years 2 months ago
Place-Boundedness for Vector Addition Systems with one zero-test
Reachability and boundedness problems have been shown decidable for Vector Addition Systems with one zero-test. Surprisingly, place-boundedness remained open. We provide here a va...
Rémi Bonnet, Alain Finkel, Jérô...
SOFSEM
2010
Springer
14 years 1 months ago
Mixing Coverability and Reachability to Analyze VASS with One Zero-Test
We study Vector Addition Systems with States (VASS) extended in such a way that one of the manipulated integer variables can be tested to zero. For this class of system, it has bee...
Alain Finkel, Arnaud Sangnier
PEPM
2010
ACM
14 years 1 months ago
Conditional weighted pushdown systems and applications
Pushdown systems are well understood as abstract models of programs with (recursive) procedures. Reps et al. recently extended pushdown systems into weighted pushdown systems, whi...
Xin Li, Mizuhito Ogawa
IPL
2010
80views more  IPL 2010»
13 years 2 months ago
The reachability problem for branching vector addition systems requires doubly-exponential space
Branching vector addition systems are an extension of vector addition systems where new reachable vectors may be obtained by summing two reachable vectors and adding an integral v...
Ranko Lazic